./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:07:32,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:07:32,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 18:07:32,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:07:32,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:07:32,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:07:32,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:07:32,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:07:32,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:07:32,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:07:32,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:07:32,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:07:32,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:07:32,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:07:32,613 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:07:32,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:07:32,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:07:32,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:07:32,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:07:32,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:07:32,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:07:32,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:07:32,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:07:32,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:07:32,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:07:32,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:07:32,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:07:32,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:32,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:07:32,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:07:32,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:07:32,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:07:32,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:07:32,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:07:32,620 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2024-10-11 18:07:32,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:07:32,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:07:32,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:07:32,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:07:32,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:07:32,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-10-11 18:07:34,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:07:34,557 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:07:34,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-10-11 18:07:34,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21f2ff93f/cb2d542cb301447596089c79fd919623/FLAGeaaa22f77 [2024-10-11 18:07:34,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21f2ff93f/cb2d542cb301447596089c79fd919623 [2024-10-11 18:07:34,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:07:34,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:07:34,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:34,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:07:34,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:07:34,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:34,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f26755b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34, skipping insertion in model container [2024-10-11 18:07:34,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:34,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:07:34,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:34,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:07:34,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:34,997 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:07:34,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34 WrapperNode [2024-10-11 18:07:34,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:34,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:34,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:07:34,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:07:35,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,049 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-10-11 18:07:35,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:35,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:07:35,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:07:35,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:07:35,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,095 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-10-11 18:07:35,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:07:35,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:07:35,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:07:35,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:07:35,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (1/1) ... [2024-10-11 18:07:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:35,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:07:35,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:07:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:07:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:07:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:07:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:07:35,379 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:07:35,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:07:35,646 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-10-11 18:07:35,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:07:35,708 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:07:35,708 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:07:35,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:35 BoogieIcfgContainer [2024-10-11 18:07:35,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:07:35,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:07:35,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:07:35,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:07:35,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:07:34" (1/3) ... [2024-10-11 18:07:35,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e7e776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:35, skipping insertion in model container [2024-10-11 18:07:35,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:34" (2/3) ... [2024-10-11 18:07:35,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e7e776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:35, skipping insertion in model container [2024-10-11 18:07:35,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:35" (3/3) ... [2024-10-11 18:07:35,716 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2024-10-11 18:07:35,748 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:07:35,748 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-11 18:07:35,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:07:35,790 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@602a977c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:07:35,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-10-11 18:07:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:35,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:35,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:35,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 5153845, now seen corresponding path program 1 times [2024-10-11 18:07:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055215390] [2024-10-11 18:07:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055215390] [2024-10-11 18:07:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055215390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638580408] [2024-10-11 18:07:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:36,137 INFO L87 Difference]: Start difference. First operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,256 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-11 18:07:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,265 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:36,266 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:07:36,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:36,273 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:07:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 18:07:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 32 states have (on average 2.125) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-11 18:07:36,310 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 4 [2024-10-11 18:07:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,311 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-11 18:07:36,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-11 18:07:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:36,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:36,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:07:36,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 5153846, now seen corresponding path program 1 times [2024-10-11 18:07:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222240787] [2024-10-11 18:07:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222240787] [2024-10-11 18:07:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222240787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826626287] [2024-10-11 18:07:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:36,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:36,391 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,450 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-11 18:07:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,452 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:07:36,452 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:07:36,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:36,453 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:07:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 18:07:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.0625) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-11 18:07:36,459 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 4 [2024-10-11 18:07:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-11 18:07:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-11 18:07:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:07:36,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 863364339, now seen corresponding path program 1 times [2024-10-11 18:07:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739007198] [2024-10-11 18:07:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739007198] [2024-10-11 18:07:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739007198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306049357] [2024-10-11 18:07:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:36,635 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,773 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-10-11 18:07:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 18:07:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,775 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:36,775 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:07:36,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:36,776 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 111 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:07:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-11 18:07:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 2.03125) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-10-11 18:07:36,784 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2024-10-11 18:07:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-10-11 18:07:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-10-11 18:07:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:36,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:07:36,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 863364338, now seen corresponding path program 1 times [2024-10-11 18:07:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876461279] [2024-10-11 18:07:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876461279] [2024-10-11 18:07:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876461279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704430080] [2024-10-11 18:07:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:36,885 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,983 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-11 18:07:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 18:07:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,985 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:07:36,986 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:07:36,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:36,987 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:07:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-11 18:07:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-11 18:07:36,998 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 8 [2024-10-11 18:07:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,998 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-11 18:07:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-11 18:07:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:36,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:07:36,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:37,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash 994494627, now seen corresponding path program 1 times [2024-10-11 18:07:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501709843] [2024-10-11 18:07:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501709843] [2024-10-11 18:07:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501709843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865886889] [2024-10-11 18:07:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:37,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:37,211 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:37,349 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-11 18:07:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:37,351 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:07:37,351 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:07:37,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:37,353 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:37,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 165 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:07:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-11 18:07:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:07:37,357 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 9 [2024-10-11 18:07:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:37,358 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:07:37,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:07:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:37,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:37,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:07:37,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 994494628, now seen corresponding path program 1 times [2024-10-11 18:07:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775127806] [2024-10-11 18:07:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775127806] [2024-10-11 18:07:37,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775127806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908477357] [2024-10-11 18:07:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:37,730 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:37,892 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-11 18:07:37,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:37,894 INFO L225 Difference]: With dead ends: 63 [2024-10-11 18:07:37,897 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 18:07:37,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:37,898 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:37,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 18:07:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-11 18:07:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-11 18:07:37,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 9 [2024-10-11 18:07:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-11 18:07:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-11 18:07:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:37,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:37,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:37,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:07:37,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816035, now seen corresponding path program 1 times [2024-10-11 18:07:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679506528] [2024-10-11 18:07:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679506528] [2024-10-11 18:07:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679506528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757257113] [2024-10-11 18:07:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:37,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:37,998 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,126 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-10-11 18:07:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,127 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:38,127 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:38,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:38,128 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2024-10-11 18:07:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 68 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2024-10-11 18:07:38,134 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 14 [2024-10-11 18:07:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,135 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2024-10-11 18:07:38,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2024-10-11 18:07:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:38,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:07:38,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:38,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816036, now seen corresponding path program 1 times [2024-10-11 18:07:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980552370] [2024-10-11 18:07:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980552370] [2024-10-11 18:07:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980552370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220621111] [2024-10-11 18:07:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:38,326 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,517 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-10-11 18:07:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:38,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,518 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:07:38,518 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:07:38,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:38,519 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 274 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:07:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2024-10-11 18:07:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 71 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-10-11 18:07:38,529 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 14 [2024-10-11 18:07:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,529 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-10-11 18:07:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-10-11 18:07:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:07:38,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:07:38,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439037, now seen corresponding path program 1 times [2024-10-11 18:07:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928840605] [2024-10-11 18:07:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928840605] [2024-10-11 18:07:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928840605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:07:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597856196] [2024-10-11 18:07:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:07:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:07:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:07:38,591 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,684 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-10-11 18:07:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:07:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:07:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,686 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:07:38,686 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:07:38,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:38,687 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:07:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 18:07:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 75 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-10-11 18:07:38,693 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 15 [2024-10-11 18:07:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,694 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-10-11 18:07:38,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-10-11 18:07:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:07:38,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:07:38,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439036, now seen corresponding path program 1 times [2024-10-11 18:07:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461808415] [2024-10-11 18:07:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461808415] [2024-10-11 18:07:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461808415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231671261] [2024-10-11 18:07:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:39,039 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,215 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2024-10-11 18:07:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:07:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,216 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:39,216 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:39,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:39,217 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:07:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-10-11 18:07:39,221 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 15 [2024-10-11 18:07:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-10-11 18:07:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-10-11 18:07:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:39,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:07:39,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1287019437, now seen corresponding path program 1 times [2024-10-11 18:07:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035508237] [2024-10-11 18:07:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035508237] [2024-10-11 18:07:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035508237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:39,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88189100] [2024-10-11 18:07:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:39,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:39,321 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,402 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2024-10-11 18:07:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 18:07:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,403 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:07:39,403 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:07:39,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:39,404 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:07:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-11 18:07:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.7857142857142858) internal successors, (100), 79 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2024-10-11 18:07:39,409 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 16 [2024-10-11 18:07:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2024-10-11 18:07:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2024-10-11 18:07:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:07:39,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:07:39,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 239755371, now seen corresponding path program 1 times [2024-10-11 18:07:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771374145] [2024-10-11 18:07:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771374145] [2024-10-11 18:07:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771374145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407607803] [2024-10-11 18:07:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:39,604 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,675 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-10-11 18:07:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:07:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 18:07:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,676 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:39,676 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:39,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:39,677 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:07:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 79 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-11 18:07:39,680 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 17 [2024-10-11 18:07:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,680 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-11 18:07:39,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-11 18:07:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:07:39,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:07:39,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 239755372, now seen corresponding path program 1 times [2024-10-11 18:07:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983833988] [2024-10-11 18:07:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983833988] [2024-10-11 18:07:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983833988] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670494879] [2024-10-11 18:07:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:40,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:07:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 18:07:40,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:40,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:07:40,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:07:40,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:40,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:40,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:40,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:40,449 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:07:40,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:40,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:40,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:40,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:07:40,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670494879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:40,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-11 18:07:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838139895] [2024-10-11 18:07:40,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:07:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:07:40,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:07:40,608 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:40,863 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-10-11 18:07:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2024-10-11 18:07:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:40,865 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:07:40,865 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:07:40,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-10-11 18:07:40,866 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:40,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 231 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 325 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-10-11 18:07:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:07:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-11 18:07:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 79 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-10-11 18:07:40,869 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 17 [2024-10-11 18:07:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-10-11 18:07:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-10-11 18:07:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:40,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:40,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:40,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:41,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:07:41,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:41,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:41,071 INFO L85 PathProgramCache]: Analyzing trace with hash 237319682, now seen corresponding path program 1 times [2024-10-11 18:07:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:41,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811542546] [2024-10-11 18:07:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811542546] [2024-10-11 18:07:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811542546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20180226] [2024-10-11 18:07:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:41,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:41,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:07:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 18:07:41,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:41,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:07:41,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:41,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:41,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:41,768 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:41,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:41,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:41,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:41,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:41,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:41,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:41,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:41,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:42,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:42,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-11 18:07:42,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:42,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2024-10-11 18:07:42,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:42,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:42,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-11 18:07:42,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:42,680 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:42,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2024-10-11 18:07:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20180226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:46,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:46,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2024-10-11 18:07:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673190685] [2024-10-11 18:07:46,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:46,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 18:07:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 18:07:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=662, Unknown=3, NotChecked=0, Total=756 [2024-10-11 18:07:46,016 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:46,556 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-11 18:07:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:46,557 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-10-11 18:07:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:46,558 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:07:46,558 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:07:46,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=108, Invalid=759, Unknown=3, NotChecked=0, Total=870 [2024-10-11 18:07:46,559 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:46,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 692 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:07:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:07:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:07:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 80 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-10-11 18:07:46,562 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 18 [2024-10-11 18:07:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-10-11 18:07:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-10-11 18:07:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:46,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:46,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:46,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:07:46,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:46,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227119, now seen corresponding path program 1 times [2024-10-11 18:07:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:46,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305317592] [2024-10-11 18:07:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:07:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305317592] [2024-10-11 18:07:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305317592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657930984] [2024-10-11 18:07:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:46,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:46,877 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:47,001 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-10-11 18:07:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:07:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:47,002 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:47,002 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:47,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:47,003 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:47,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 197 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:07:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 79 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-10-11 18:07:47,006 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 19 [2024-10-11 18:07:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:47,006 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-10-11 18:07:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-10-11 18:07:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:47,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:47,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:47,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:07:47,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227118, now seen corresponding path program 1 times [2024-10-11 18:07:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143374872] [2024-10-11 18:07:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143374872] [2024-10-11 18:07:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143374872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709145184] [2024-10-11 18:07:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:47,271 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:47,433 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-11 18:07:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:07:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:47,434 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:47,434 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:47,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:47,435 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:47,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:07:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 78 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2024-10-11 18:07:47,440 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 19 [2024-10-11 18:07:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:47,440 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2024-10-11 18:07:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2024-10-11 18:07:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:47,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:47,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:47,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:07:47,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139404, now seen corresponding path program 1 times [2024-10-11 18:07:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376309972] [2024-10-11 18:07:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376309972] [2024-10-11 18:07:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376309972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262341235] [2024-10-11 18:07:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:47,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:47,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:07:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:07:47,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:47,637 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:47,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-10-11 18:07:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262341235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:47,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-11 18:07:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286314107] [2024-10-11 18:07:47,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:47,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:47,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:47,647 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:47,786 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-10-11 18:07:47,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:47,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 18:07:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:47,787 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:47,787 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:47,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:47,787 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:47,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 133 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-11 18:07:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 78 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2024-10-11 18:07:47,792 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 19 [2024-10-11 18:07:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:47,792 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2024-10-11 18:07:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2024-10-11 18:07:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:47,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:47,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:47,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:47,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:47,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139403, now seen corresponding path program 1 times [2024-10-11 18:07:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684438751] [2024-10-11 18:07:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684438751] [2024-10-11 18:07:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684438751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078902047] [2024-10-11 18:07:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:48,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:48,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:07:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:48,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:07:48,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:48,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:07:48,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:07:48,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:48,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:07:48,380 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:48,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:48,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078902047] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:48,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:48,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 23 [2024-10-11 18:07:48,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824720343] [2024-10-11 18:07:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:48,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:48,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:07:48,742 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:48,921 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-10-11 18:07:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 18:07:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:48,922 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:07:48,922 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:07:48,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:07:48,923 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:48,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:07:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-10-11 18:07:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 81 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-10-11 18:07:48,927 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 19 [2024-10-11 18:07:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-10-11 18:07:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-10-11 18:07:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:48,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:48,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:48,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:07:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:07:49,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash 427395377, now seen corresponding path program 1 times [2024-10-11 18:07:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898333135] [2024-10-11 18:07:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898333135] [2024-10-11 18:07:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898333135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:07:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383269498] [2024-10-11 18:07:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:49,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:49,223 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:49,327 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2024-10-11 18:07:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:07:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:49,328 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:07:49,328 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:07:49,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:49,329 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:49,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:07:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-10-11 18:07:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-10-11 18:07:49,331 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 20 [2024-10-11 18:07:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:49,332 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-10-11 18:07:49,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-10-11 18:07:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:49,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:49,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:49,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:07:49,333 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:49,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 427384198, now seen corresponding path program 1 times [2024-10-11 18:07:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:49,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075378506] [2024-10-11 18:07:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075378506] [2024-10-11 18:07:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075378506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446509897] [2024-10-11 18:07:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:49,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:49,451 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:49,587 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-10-11 18:07:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:07:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:49,589 INFO L225 Difference]: With dead ends: 95 [2024-10-11 18:07:49,589 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 18:07:49,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:49,590 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:49,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 18:07:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-10-11 18:07:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-10-11 18:07:49,596 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 20 [2024-10-11 18:07:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:49,597 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-10-11 18:07:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-10-11 18:07:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:49,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:49,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:49,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:07:49,597 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 762676370, now seen corresponding path program 1 times [2024-10-11 18:07:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:49,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350038554] [2024-10-11 18:07:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350038554] [2024-10-11 18:07:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350038554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249769703] [2024-10-11 18:07:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:49,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:49,960 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:50,164 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-10-11 18:07:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 18:07:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:50,165 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:07:50,165 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:07:50,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:07:50,166 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:50,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 268 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:07:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 18:07:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5) internal successors, (93), 81 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-10-11 18:07:50,168 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 21 [2024-10-11 18:07:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:50,169 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-10-11 18:07:50,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-10-11 18:07:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:50,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:50,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:07:50,169 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 762676369, now seen corresponding path program 1 times [2024-10-11 18:07:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087343357] [2024-10-11 18:07:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087343357] [2024-10-11 18:07:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087343357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:50,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648612727] [2024-10-11 18:07:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:50,403 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:50,596 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-11 18:07:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-11 18:07:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:50,597 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:07:50,597 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:07:50,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:07:50,598 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:50,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 259 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:07:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:07:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-11 18:07:50,600 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2024-10-11 18:07:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-11 18:07:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-11 18:07:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:50,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:50,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:07:50,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:50,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 364008372, now seen corresponding path program 1 times [2024-10-11 18:07:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008705268] [2024-10-11 18:07:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008705268] [2024-10-11 18:07:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008705268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899728152] [2024-10-11 18:07:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:50,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:50,728 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:50,879 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2024-10-11 18:07:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 18:07:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:50,880 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:07:50,880 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:07:50,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:50,881 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:50,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 164 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:07:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-10-11 18:07:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 82 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-10-11 18:07:50,884 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 21 [2024-10-11 18:07:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:50,884 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-10-11 18:07:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-10-11 18:07:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:50,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:50,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:07:50,885 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1600642232, now seen corresponding path program 1 times [2024-10-11 18:07:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151137313] [2024-10-11 18:07:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151137313] [2024-10-11 18:07:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151137313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:51,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:51,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220286938] [2024-10-11 18:07:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:51,059 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:51,205 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-10-11 18:07:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 18:07:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:51,206 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:07:51,206 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:07:51,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:51,209 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:51,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 206 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:07:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 18:07:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 83 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-10-11 18:07:51,212 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 22 [2024-10-11 18:07:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:51,212 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-10-11 18:07:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-10-11 18:07:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:07:51,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:51,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:51,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:07:51,213 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -618888661, now seen corresponding path program 1 times [2024-10-11 18:07:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460341715] [2024-10-11 18:07:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460341715] [2024-10-11 18:07:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460341715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493342588] [2024-10-11 18:07:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:51,428 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:51,640 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2024-10-11 18:07:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 18:07:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:51,641 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:07:51,642 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:07:51,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:07:51,642 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:51,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 188 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:07:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 18:07:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 85 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-11 18:07:51,646 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 24 [2024-10-11 18:07:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:51,646 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-11 18:07:51,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-11 18:07:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:07:51,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:51,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:07:51,646 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -618888660, now seen corresponding path program 1 times [2024-10-11 18:07:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594198806] [2024-10-11 18:07:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:51,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594198806] [2024-10-11 18:07:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594198806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391021054] [2024-10-11 18:07:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:51,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:51,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:51,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:07:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:07:52,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:52,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:52,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:52,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-11 18:07:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391021054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:52,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-10-11 18:07:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737812144] [2024-10-11 18:07:52,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:07:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:07:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:07:52,258 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:52,583 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-10-11 18:07:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 18:07:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:52,584 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:07:52,584 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:07:52,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:07:52,585 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:52,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 328 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:07:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:07:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-11 18:07:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 86 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-11 18:07:52,593 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 24 [2024-10-11 18:07:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-11 18:07:52,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-11 18:07:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:07:52,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:52,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:52,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:07:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:07:52,796 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2046483990, now seen corresponding path program 1 times [2024-10-11 18:07:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831899733] [2024-10-11 18:07:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831899733] [2024-10-11 18:07:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831899733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191595973] [2024-10-11 18:07:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:52,923 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:53,059 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-11 18:07:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:07:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:53,060 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:07:53,060 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:07:53,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:53,061 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:53,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 206 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:07:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:07:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.434782608695652) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-11 18:07:53,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 26 [2024-10-11 18:07:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:53,064 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-11 18:07:53,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-11 18:07:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:07:53,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:53,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:53,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:07:53,065 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:53,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -755062877, now seen corresponding path program 1 times [2024-10-11 18:07:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509358327] [2024-10-11 18:07:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:53,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509358327] [2024-10-11 18:07:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509358327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473115944] [2024-10-11 18:07:53,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:53,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:53,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:07:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:07:53,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:07:53,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:53,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:53,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-11 18:07:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:07:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473115944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:54,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 21 [2024-10-11 18:07:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499785200] [2024-10-11 18:07:54,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:07:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:07:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:07:54,044 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:07:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:54,381 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-11 18:07:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 28 [2024-10-11 18:07:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:54,382 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:07:54,382 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:07:54,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:07:54,382 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:54,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 349 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:07:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 18:07:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-10-11 18:07:54,385 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 28 [2024-10-11 18:07:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-10-11 18:07:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:07:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-10-11 18:07:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:07:54,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:54,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:54,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:07:54,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:07:54,592 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:54,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135946, now seen corresponding path program 1 times [2024-10-11 18:07:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211377722] [2024-10-11 18:07:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:07:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:07:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211377722] [2024-10-11 18:07:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211377722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505053845] [2024-10-11 18:07:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:55,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:55,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:07:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:07:55,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:55,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:55,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:55,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:07:55,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:07:55,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:07:55,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:07:55,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:07:55,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:07:55,328 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-11 18:07:55,350 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:07:55,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:07:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-10-11 18:07:55,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505053845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:55,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:55,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2024-10-11 18:07:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264959606] [2024-10-11 18:07:55,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:07:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:55,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:07:55,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:07:55,400 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:07:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:55,682 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-11 18:07:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:55,683 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-10-11 18:07:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:55,683 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:07:55,683 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:07:55,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=600, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:07:55,684 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:55,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 384 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2024-10-11 18:07:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:07:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:07:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.391304347826087) internal successors, (96), 85 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-10-11 18:07:55,691 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 30 [2024-10-11 18:07:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:55,691 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-10-11 18:07:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:07:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-10-11 18:07:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:07:55,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:55,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:55,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:07:55,893 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135947, now seen corresponding path program 1 times [2024-10-11 18:07:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337370371] [2024-10-11 18:07:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:07:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:07:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337370371] [2024-10-11 18:07:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337370371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323293122] [2024-10-11 18:07:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:56,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:56,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:56,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:56,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:07:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 18:07:56,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:56,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:56,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:56,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:07:56,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:07:56,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:07:56,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2024-10-11 18:07:56,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-10-11 18:07:56,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:07:56,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2024-10-11 18:07:56,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-10-11 18:07:56,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2024-10-11 18:07:56,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-10-11 18:07:57,028 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:07:57,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:57,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:57,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:57,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:07:57,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323293122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:57,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-10-11 18:07:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866360458] [2024-10-11 18:07:57,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:57,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 18:07:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 18:07:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2024-10-11 18:07:57,180 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:07:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:57,769 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-11 18:07:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:07:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 30 [2024-10-11 18:07:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:57,770 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:07:57,770 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:07:57,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1489, Unknown=1, NotChecked=80, Total=1806 [2024-10-11 18:07:57,772 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:57,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 500 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 535 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2024-10-11 18:07:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:07:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:07:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-11 18:07:57,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 30 [2024-10-11 18:07:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,775 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-11 18:07:57,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:07:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-11 18:07:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:07:57,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,776 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:57,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:57,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:57,981 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 256364298, now seen corresponding path program 1 times [2024-10-11 18:07:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616838195] [2024-10-11 18:07:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616838195] [2024-10-11 18:07:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616838195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:58,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397248944] [2024-10-11 18:07:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:58,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:58,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:07:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 18:07:58,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:58,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:58,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:58,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:07:58,558 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:07:58,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:07:58,571 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:07:58,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:07:58,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 18:07:58,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 18:07:58,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-10-11 18:07:58,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:58,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:58,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2024-10-11 18:07:58,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:58,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2024-10-11 18:07:58,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:59,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:59,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:07:59,298 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|))) (or (= |c_ULTIMATE.start_create_~dll~0#1.base| (select .cse0 0)) (= (select .cse0 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_2044 (Array Int Int))) (= |c_ULTIMATE.start_create_~dll~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 0))) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))))) is different from false [2024-10-11 18:07:59,320 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select .cse0 0))))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)) (forall ((v_ArrVal_2044 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|) 0)))))) is different from false [2024-10-11 18:07:59,389 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) |c_alloc_and_zero_#res.base|)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_2044 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|) 0) |c_alloc_and_zero_#res.base|)) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0))))) is different from false [2024-10-11 18:07:59,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:59,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-11 18:07:59,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-11 18:07:59,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-11 18:07:59,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-11 18:07:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 18:07:59,545 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:59,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-11 18:07:59,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:59,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-11 18:07:59,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:59,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:59,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-10-11 18:07:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397248944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:59,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 33 [2024-10-11 18:07:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648119613] [2024-10-11 18:07:59,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:07:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:07:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=768, Unknown=30, NotChecked=174, Total=1056 [2024-10-11 18:07:59,580 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:08:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:00,453 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2024-10-11 18:08:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:08:00,453 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-11 18:08:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:00,454 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:08:00,454 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:08:00,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1311, Unknown=38, NotChecked=228, Total=1722 [2024-10-11 18:08:00,455 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:00,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 450 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 944 Invalid, 0 Unknown, 186 Unchecked, 0.6s Time] [2024-10-11 18:08:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:08:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2024-10-11 18:08:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 95 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2024-10-11 18:08:00,458 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 29 [2024-10-11 18:08:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2024-10-11 18:08:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:08:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2024-10-11 18:08:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:08:00,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:00,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:00,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:08:00,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:00,664 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:00,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash -642642783, now seen corresponding path program 1 times [2024-10-11 18:08:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563997628] [2024-10-11 18:08:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563997628] [2024-10-11 18:08:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563997628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136306626] [2024-10-11 18:08:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:01,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:01,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:08:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:08:01,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:01,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:01,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:01,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2024-10-11 18:08:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:02,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:02,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 18:08:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-10-11 18:08:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136306626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:03,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-10-11 18:08:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790856754] [2024-10-11 18:08:03,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:08:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:08:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=912, Unknown=2, NotChecked=0, Total=992 [2024-10-11 18:08:03,243 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:04,299 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2024-10-11 18:08:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:08:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-11 18:08:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:04,300 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:08:04,300 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:08:04,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=1581, Unknown=2, NotChecked=0, Total=1722 [2024-10-11 18:08:04,301 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:04,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 321 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 731 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:08:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:08:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 18:08:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-10-11 18:08:04,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 30 [2024-10-11 18:08:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:04,305 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-10-11 18:08:04,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-10-11 18:08:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:04,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:04,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:04,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:08:04,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 18:08:04,508 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522749, now seen corresponding path program 1 times [2024-10-11 18:08:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385507152] [2024-10-11 18:08:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385507152] [2024-10-11 18:08:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385507152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829350440] [2024-10-11 18:08:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:05,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:05,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:08:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 18:08:05,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:05,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:05,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:05,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:05,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 18:08:05,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:05,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-10-11 18:08:05,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:05,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:05,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:05,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:05,739 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-11 18:08:05,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:08:05,938 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-10-11 18:08:05,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2024-10-11 18:08:05,999 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-10-11 18:08:05,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 109 [2024-10-11 18:08:06,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:06,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2024-10-11 18:08:06,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2024-10-11 18:08:06,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:08:06,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:08:06,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:06,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2024-10-11 18:08:06,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:06,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-10-11 18:08:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829350440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:06,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-11 18:08:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418178469] [2024-10-11 18:08:06,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:06,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:08:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:08:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1649, Unknown=7, NotChecked=0, Total=1806 [2024-10-11 18:08:06,458 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:06,870 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-10-11 18:08:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-10-11 18:08:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:06,871 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:08:06,871 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:08:06,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=2301, Unknown=7, NotChecked=0, Total=2550 [2024-10-11 18:08:06,872 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:06,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 484 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:08:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:08:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-11 18:08:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-10-11 18:08:06,874 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 31 [2024-10-11 18:08:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:06,874 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-10-11 18:08:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-10-11 18:08:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:06,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:06,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:06,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:07,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 18:08:07,075 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522748, now seen corresponding path program 1 times [2024-10-11 18:08:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755524936] [2024-10-11 18:08:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755524936] [2024-10-11 18:08:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755524936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677132202] [2024-10-11 18:08:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:07,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:07,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:08:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 18:08:07,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:08,068 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:08,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:08,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:08:08,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:08,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:08,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2024-10-11 18:08:08,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:08,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:08,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:08:08,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:08,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:08,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:08:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:08,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:08,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:08,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 116 [2024-10-11 18:08:09,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2024-10-11 18:08:09,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:09,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 123 [2024-10-11 18:08:09,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-10-11 18:08:09,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2024-10-11 18:08:09,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:09,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2024-10-11 18:08:09,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:09,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:09,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:09,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 18:08:09,090 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:09,095 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-11 18:08:09,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-10-11 18:08:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677132202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:09,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:09,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2024-10-11 18:08:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778723324] [2024-10-11 18:08:09,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:09,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:08:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:08:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1798, Unknown=10, NotChecked=0, Total=1980 [2024-10-11 18:08:09,202 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:09,672 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-10-11 18:08:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:09,672 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-10-11 18:08:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:09,673 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:08:09,673 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:08:09,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=2195, Unknown=10, NotChecked=0, Total=2450 [2024-10-11 18:08:09,674 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:09,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 650 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:08:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-11 18:08:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 84 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-10-11 18:08:09,677 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 31 [2024-10-11 18:08:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:09,677 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-10-11 18:08:09,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-10-11 18:08:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:08:09,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:09,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:09,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:09,878 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash -657671097, now seen corresponding path program 1 times [2024-10-11 18:08:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44447507] [2024-10-11 18:08:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:08:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44447507] [2024-10-11 18:08:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44447507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091438254] [2024-10-11 18:08:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:10,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:10,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:10,459 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:10,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:08:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 18:08:10,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:10,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:10,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:10,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:10,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:08:11,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:11,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-10-11 18:08:11,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2024-10-11 18:08:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-11 18:08:11,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:08:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:11,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:11,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:11,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2024-10-11 18:08:11,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2024-10-11 18:08:11,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-10-11 18:08:11,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091438254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:11,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2024-10-11 18:08:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333049255] [2024-10-11 18:08:11,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:11,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:08:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:08:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1322, Unknown=14, NotChecked=0, Total=1482 [2024-10-11 18:08:11,910 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:12,334 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2024-10-11 18:08:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:08:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-10-11 18:08:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:12,335 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:08:12,335 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:08:12,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=244, Invalid=1998, Unknown=14, NotChecked=0, Total=2256 [2024-10-11 18:08:12,336 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:12,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 381 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:08:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:08:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2024-10-11 18:08:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.35) internal successors, (108), 92 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2024-10-11 18:08:12,339 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 33 [2024-10-11 18:08:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:12,339 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2024-10-11 18:08:12,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2024-10-11 18:08:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:12,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:12,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:12,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:12,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:12,542 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1485700593, now seen corresponding path program 1 times [2024-10-11 18:08:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802002891] [2024-10-11 18:08:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:08:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:08:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802002891] [2024-10-11 18:08:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802002891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017235563] [2024-10-11 18:08:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:13,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:13,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:13,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:13,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:08:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:13,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 18:08:13,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:13,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:13,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:13,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:13,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:13,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 18:08:13,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:13,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2024-10-11 18:08:13,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:13,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:13,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:08:13,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:13,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:13,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:13,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:08:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:13,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:13,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:08:13,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:13,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:08:13,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:08:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:13,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:13,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2832) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2833) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))) (forall ((v_ArrVal_2832 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2832) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))))) is different from false [2024-10-11 18:08:13,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:13,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-11 18:08:13,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:13,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-11 18:08:13,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-10-11 18:08:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-10-11 18:08:13,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:08:13,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:14,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-11 18:08:14,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:14,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 18:08:14,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2828 (Array Int Int))) (not (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2828) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) 0))) is different from false [2024-10-11 18:08:14,296 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2024-10-11 18:08:14,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2024-10-11 18:08:14,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2827 Int) (v_ArrVal_2828 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ 16 |c_ULTIMATE.start_create_#t~mem9#1.offset|) v_ArrVal_2827)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2828)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-10-11 18:08:14,390 INFO L349 Elim1Store]: treesize reduction 24, result has 61.3 percent of original size [2024-10-11 18:08:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 97 [2024-10-11 18:08:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 241 [2024-10-11 18:08:14,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-10-11 18:08:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:08:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 1 times theorem prover too weak. 4 trivial. 2 not checked. [2024-10-11 18:08:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017235563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:14,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 18] total 49 [2024-10-11 18:08:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928964100] [2024-10-11 18:08:14,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:14,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 18:08:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 18:08:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1970, Unknown=32, NotChecked=276, Total=2450 [2024-10-11 18:08:14,549 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:08:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:15,111 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-10-11 18:08:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:08:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 34 [2024-10-11 18:08:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:15,112 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:08:15,112 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:08:15,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=2475, Unknown=32, NotChecked=312, Total=3080 [2024-10-11 18:08:15,113 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:15,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 835 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 604 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2024-10-11 18:08:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:08:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 18:08:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3375) internal successors, (107), 91 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2024-10-11 18:08:15,115 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 34 [2024-10-11 18:08:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:15,116 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2024-10-11 18:08:15,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:08:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2024-10-11 18:08:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:15,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:15,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:15,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:15,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 18:08:15,317 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1087032595, now seen corresponding path program 1 times [2024-10-11 18:08:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384326350] [2024-10-11 18:08:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:08:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384326350] [2024-10-11 18:08:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384326350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029278327] [2024-10-11 18:08:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:15,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:15,774 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:15,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:08:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:15,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 18:08:15,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:16,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:16,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-11 18:08:16,127 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:16,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:16,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 18:08:16,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:16,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-10-11 18:08:16,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:16,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-10-11 18:08:16,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:16,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:16,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029278327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:16,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:16,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2024-10-11 18:08:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967746929] [2024-10-11 18:08:16,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:16,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:08:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:08:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1324, Unknown=14, NotChecked=0, Total=1482 [2024-10-11 18:08:16,762 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:17,284 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-10-11 18:08:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:08:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-10-11 18:08:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:17,285 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:08:17,285 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:08:17,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=2002, Unknown=14, NotChecked=0, Total=2256 [2024-10-11 18:08:17,286 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:17,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 397 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:08:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-10-11 18:08:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.329268292682927) internal successors, (109), 93 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2024-10-11 18:08:17,288 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 34 [2024-10-11 18:08:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:17,288 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2024-10-11 18:08:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2024-10-11 18:08:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:17,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:17,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:17,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:17,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-11 18:08:17,489 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:17,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1199448066, now seen corresponding path program 2 times [2024-10-11 18:08:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632723035] [2024-10-11 18:08:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632723035] [2024-10-11 18:08:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632723035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58614639] [2024-10-11 18:08:18,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:08:18,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:18,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:18,534 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:18,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:08:18,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:08:18,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:08:18,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-11 18:08:18,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:18,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:18,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:18,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:08:18,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:08:18,901 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:18,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:18,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-11 18:08:18,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 18:08:19,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,048 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:08:19,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 62 [2024-10-11 18:08:19,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-10-11 18:08:19,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,203 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-10-11 18:08:19,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 69 [2024-10-11 18:08:19,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2024-10-11 18:08:19,488 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:08:19,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2024-10-11 18:08:19,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-10-11 18:08:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:19,528 INFO L311 TraceCheckSpWp]: Computing backward predicates...