./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/sll-nested-sll-inline.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/sll-nested-sll-inline.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 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:09:04,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:09:04,412 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:09:04,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:09:04,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:09:04,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:09:04,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:09:04,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:09:04,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:09:04,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:09:04,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:09:04,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:09:04,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:09:04,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:09:04,449 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:09:04,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:09:04,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:09:04,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:09:04,449 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:09:04,450 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:09:04,450 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:09:04,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:09:04,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:09:04,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:09:04,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:09:04,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:09:04,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:09:04,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:09:04,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:09:04,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:09:04,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:09:04,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:09:04,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:09:04,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:09:04,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:09:04,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:09:04,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:09:04,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:09:04,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:09:04,456 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 -> 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e [2024-10-11 18:09:04,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:09:04,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:09:04,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:09:04,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:09:04,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:09:04,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2024-10-11 18:09:06,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:09:06,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:09:06,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2024-10-11 18:09:06,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa569e4d7/060d3d06c11d407e96b796d557f7a61d/FLAG279ffa775 [2024-10-11 18:09:06,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa569e4d7/060d3d06c11d407e96b796d557f7a61d [2024-10-11 18:09:06,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:09:06,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:09:06,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:06,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:09:06,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:09:06,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:06,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b365c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06, skipping insertion in model container [2024-10-11 18:09:06,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:06,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:09:06,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:06,818 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:09:06,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:09:06,929 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:09:06,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06 WrapperNode [2024-10-11 18:09:06,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:09:06,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:09:06,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:09:06,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:09:06,938 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:09:06" (1/1) ... [2024-10-11 18:09:06,953 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:09:06" (1/1) ... [2024-10-11 18:09:06,974 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-10-11 18:09:06,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:09:06,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:09:06,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:09:06,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:09:06,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:06,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:06,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,021 INFO L175 MemorySlicer]: Split 18 memory accesses to 1 slices as follows [18]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-10-11 18:09:07,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:09:07,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:09:07,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:09:07,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:09:07,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (1/1) ... [2024-10-11 18:09:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:09:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:07,072 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:09:07,075 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:09:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-10-11 18:09:07,119 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-10-11 18:09:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:09:07,119 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:09:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:09:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:09:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:09:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:09:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:09:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:09:07,225 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:09:07,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:09:07,505 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-11 18:09:07,505 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:09:07,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:09:07,559 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-11 18:09:07,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:09:07 BoogieIcfgContainer [2024-10-11 18:09:07,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:09:07,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:09:07,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:09:07,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:09:07,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:09:06" (1/3) ... [2024-10-11 18:09:07,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3353f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:09:07, skipping insertion in model container [2024-10-11 18:09:07,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:09:06" (2/3) ... [2024-10-11 18:09:07,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3353f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:09:07, skipping insertion in model container [2024-10-11 18:09:07,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:09:07" (3/3) ... [2024-10-11 18:09:07,568 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-inline.i [2024-10-11 18:09:07,582 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:09:07,582 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-10-11 18:09:07,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:09:07,632 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;@62bf10a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:09:07,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-10-11 18:09:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:09:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:09:07,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:07,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:09:07,643 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 40 more)] === [2024-10-11 18:09:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 7603434, now seen corresponding path program 1 times [2024-10-11 18:09:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:07,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877003244] [2024-10-11 18:09:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:07,883 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:09:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877003244] [2024-10-11 18:09:07,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877003244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:07,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:07,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982406501] [2024-10-11 18:09:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:07,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:07,940 INFO L87 Difference]: Start difference. First operand has 96 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:09:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:08,116 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-10-11 18:09:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:08,118 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:09:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:08,125 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:09:08,125 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:09:08,127 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:09:08,131 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:08,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:09:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:09:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 84 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:09:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-11 18:09:08,161 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 4 [2024-10-11 18:09:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:08,162 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-11 18:09:08,162 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:09:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-11 18:09:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:09:08,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:08,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:09:08,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:09:08,163 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 40 more)] === [2024-10-11 18:09:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 7603435, now seen corresponding path program 1 times [2024-10-11 18:09:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162985818] [2024-10-11 18:09:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,243 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:09:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162985818] [2024-10-11 18:09:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162985818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:09:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744425624] [2024-10-11 18:09:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:09:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:09:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:09:08,249 INFO L87 Difference]: Start difference. First operand 93 states and 103 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:09:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:08,319 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-10-11 18:09:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:09:08,320 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:09:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:08,321 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:09:08,322 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:09:08,322 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:09:08,323 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:08,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:09:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 18:09:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 44 states have (on average 2.022727272727273) internal successors, (89), 82 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:09:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-10-11 18:09:08,336 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 4 [2024-10-11 18:09:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:08,336 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-10-11 18:09:08,336 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:09:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-10-11 18:09:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:09:08,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:08,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:08,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:09:08,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 36302357, now seen corresponding path program 1 times [2024-10-11 18:09:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574003814] [2024-10-11 18:09:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,453 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:09:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574003814] [2024-10-11 18:09:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574003814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:08,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:09:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564540777] [2024-10-11 18:09:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:08,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:09:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:09:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:09:08,457 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:09:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:08,570 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-10-11 18:09:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:09:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2024-10-11 18:09:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:08,572 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:09:08,572 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:09:08,572 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:09:08,573 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:08,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:09:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:09:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 44 states have (on average 2.0) internal successors, (88), 81 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:09:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-11 18:09:08,586 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2024-10-11 18:09:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-11 18:09:08,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:09:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-11 18:09:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:09:08,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:08,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:08,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:09:08,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 36302358, now seen corresponding path program 1 times [2024-10-11 18:09:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122479983] [2024-10-11 18:09:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,716 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:09:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122479983] [2024-10-11 18:09:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122479983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:09:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473489203] [2024-10-11 18:09:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:09:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:09:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:09:08,722 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:09:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:08,815 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-10-11 18:09:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:09:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2024-10-11 18:09:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:08,816 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:09:08,818 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:09:08,818 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:09:08,819 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:08,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:09:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:09:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 80 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:09:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-10-11 18:09:08,828 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2024-10-11 18:09:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:08,828 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-10-11 18:09:08,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:09:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-10-11 18:09:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:09:08,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:08,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:08,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:09:08,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:08,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2067485473, now seen corresponding path program 1 times [2024-10-11 18:09:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315882696] [2024-10-11 18:09:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:09,106 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:09:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315882696] [2024-10-11 18:09:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315882696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:09,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080151828] [2024-10-11 18:09:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:09,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:09,108 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:09:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:09,443 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-10-11 18:09:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2024-10-11 18:09:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:09,444 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:09:09,444 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:09:09,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:09:09,445 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:09,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 279 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:09:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 18:09:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 80 states have internal predecessors, (89), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 18:09:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-11 18:09:09,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 15 [2024-10-11 18:09:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:09,456 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-11 18:09:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:09:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-11 18:09:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:09:09,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:09,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:09:09,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2067485474, now seen corresponding path program 1 times [2024-10-11 18:09:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105180893] [2024-10-11 18:09:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:09,852 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:09:09,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105180893] [2024-10-11 18:09:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105180893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:09,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:09,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:09:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513803682] [2024-10-11 18:09:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:09,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:09:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:09:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:09:09,856 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 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:09:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:10,196 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-10-11 18:09:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 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 15 [2024-10-11 18:09:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:10,201 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:09:10,201 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:09:10,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:09:10,202 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:10,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 374 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:09:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-10-11 18:09:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 92 states have internal predecessors, (106), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-10-11 18:09:10,221 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 15 [2024-10-11 18:09:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:10,222 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-10-11 18:09:10,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 9 states have internal predecessors, (11), 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:09:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-10-11 18:09:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:09:10,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:10,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:09:10,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 94334936, now seen corresponding path program 1 times [2024-10-11 18:09:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842483154] [2024-10-11 18:09:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:10,463 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:09:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842483154] [2024-10-11 18:09:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842483154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540692271] [2024-10-11 18:09:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:10,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:10,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:10,467 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:09:10,471 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:09:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:10,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:09:10,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:10,626 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:09:10,678 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-11 18:09:10,724 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:09:10,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-10-11 18:09:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:09:10,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:10,881 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:09:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540692271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:10,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:09:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2024-10-11 18:09:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016261692] [2024-10-11 18:09:10,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:09:10,883 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:11,180 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-10-11 18:09:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:09:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19 [2024-10-11 18:09:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:11,182 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:09:11,182 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:09:11,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:09:11,183 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:11,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 310 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2024-10-11 18:09:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:09:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-11 18:09:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 91 states have internal predecessors, (106), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-10-11 18:09:11,198 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 19 [2024-10-11 18:09:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-11 18:09:11,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-10-11 18:09:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:09:11,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:11,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:11,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:09:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:11,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 94334937, now seen corresponding path program 1 times [2024-10-11 18:09:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047058451] [2024-10-11 18:09:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047058451] [2024-10-11 18:09:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047058451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419263399] [2024-10-11 18:09:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:11,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:11,714 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:09:11,715 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:09:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:11,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:09:11,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:11,808 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:09:11,880 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-11 18:09:11,901 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:09:11,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-10-11 18:09:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:09:11,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:12,089 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:09:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419263399] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:12,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:09:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-11 18:09:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478655206] [2024-10-11 18:09:12,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:12,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:09:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:12,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:09:12,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:09:12,092 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:09:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:12,349 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-10-11 18:09:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 19 [2024-10-11 18:09:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:12,350 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:09:12,350 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:09:12,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-10-11 18:09:12,351 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:12,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 434 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2024-10-11 18:09:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:09:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-11 18:09:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 89 states have internal predecessors, (103), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-10-11 18:09:12,355 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 19 [2024-10-11 18:09:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:12,356 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-10-11 18:09:12,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:09:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-10-11 18:09:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:09:12,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:12,356 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:09:12,371 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:09:12,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:12,562 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 40 more)] === [2024-10-11 18:09:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 755943574, now seen corresponding path program 1 times [2024-10-11 18:09:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570987327] [2024-10-11 18:09:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:12,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:12,673 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:09:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:12,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570987327] [2024-10-11 18:09:12,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570987327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:09:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997174574] [2024-10-11 18:09:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:09:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:09:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:09:12,676 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:09:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:12,841 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2024-10-11 18:09:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:09:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 20 [2024-10-11 18:09:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:12,842 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:09:12,843 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:09:12,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:09:12,843 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:12,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 225 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:09:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2024-10-11 18:09:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.7123287671232876) internal successors, (125), 101 states have internal predecessors, (125), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 18:09:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2024-10-11 18:09:12,849 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 20 [2024-10-11 18:09:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2024-10-11 18:09:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:09:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2024-10-11 18:09:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:09:12,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:12,850 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:09:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:09:12,850 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 40 more)] === [2024-10-11 18:09:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 755943575, now seen corresponding path program 1 times [2024-10-11 18:09:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258192196] [2024-10-11 18:09:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,027 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:09:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258192196] [2024-10-11 18:09:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258192196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076754221] [2024-10-11 18:09:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:13,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:13,029 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:09:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:13,189 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2024-10-11 18:09:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 20 [2024-10-11 18:09:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:13,190 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:09:13,190 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:09:13,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:09:13,191 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 29 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:13,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 425 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:09:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-10-11 18:09:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 107 states have internal predecessors, (135), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 18:09:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2024-10-11 18:09:13,196 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 159 transitions. Word has length 20 [2024-10-11 18:09:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:13,196 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 159 transitions. [2024-10-11 18:09:13,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:09:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2024-10-11 18:09:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:09:13,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:13,197 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:09:13,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:09:13,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:13,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash 612271540, now seen corresponding path program 1 times [2024-10-11 18:09:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409569367] [2024-10-11 18:09:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,275 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:09:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409569367] [2024-10-11 18:09:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409569367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:13,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:13,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:09:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601256326] [2024-10-11 18:09:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:09:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:09:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:09:13,277 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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:09:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:13,379 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2024-10-11 18:09:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:09:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 22 [2024-10-11 18:09:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:13,381 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:09:13,381 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:09:13,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:09:13,382 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:13,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 413 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:09:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-11 18:09:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.675) internal successors, (134), 108 states have internal predecessors, (134), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 18:09:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2024-10-11 18:09:13,386 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 22 [2024-10-11 18:09:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2024-10-11 18:09:13,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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:09:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2024-10-11 18:09:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:09:13,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:13,387 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:09:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:09:13,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 612415883, now seen corresponding path program 1 times [2024-10-11 18:09:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777199375] [2024-10-11 18:09:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:13,668 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:09:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777199375] [2024-10-11 18:09:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777199375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:09:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686495039] [2024-10-11 18:09:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:13,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:09:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:09:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:09:13,670 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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:09:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:13,961 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2024-10-11 18:09:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:09:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 22 [2024-10-11 18:09:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:13,963 INFO L225 Difference]: With dead ends: 137 [2024-10-11 18:09:13,963 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 18:09:13,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:09:13,963 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 40 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:13,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 536 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 18:09:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2024-10-11 18:09:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 113 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 18:09:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-10-11 18:09:13,968 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 22 [2024-10-11 18:09:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-10-11 18:09:13,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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:09:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-10-11 18:09:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:09:13,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:13,970 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:09:13,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:09:13,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 612415884, now seen corresponding path program 1 times [2024-10-11 18:09:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920550061] [2024-10-11 18:09:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:14,426 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:09:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920550061] [2024-10-11 18:09:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920550061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:09:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108698937] [2024-10-11 18:09:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:09:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:09:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:09:14,429 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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:09:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:14,766 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2024-10-11 18:09:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:09:14,766 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2024-10-11 18:09:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:14,767 INFO L225 Difference]: With dead ends: 137 [2024-10-11 18:09:14,767 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 18:09:14,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:09:14,768 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 633 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:14,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 633 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 18:09:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2024-10-11 18:09:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 113 states have internal predecessors, (140), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 18:09:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2024-10-11 18:09:14,773 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 22 [2024-10-11 18:09:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2024-10-11 18:09:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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:09:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2024-10-11 18:09:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:09:14,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:14,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:09:14,775 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1358917054, now seen corresponding path program 1 times [2024-10-11 18:09:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:14,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755367418] [2024-10-11 18:09:14,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:15,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755367418] [2024-10-11 18:09:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755367418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830811872] [2024-10-11 18:09:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:15,171 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:09:15,178 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:09:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:15,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 18:09:15,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:15,305 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:09:15,310 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:09:15,462 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-10-11 18:09:15,505 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:09:15,506 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 17 treesize of output 21 [2024-10-11 18:09:15,515 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:09:15,606 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-11 18:09:15,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:15,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-11 18:09:15,646 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:09:15,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:09:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 18:09:15,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830811872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:15,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:15,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-10-11 18:09:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123744080] [2024-10-11 18:09:15,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:09:15,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:09:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=2, NotChecked=82, Total=552 [2024-10-11 18:09:15,808 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:09:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:16,366 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2024-10-11 18:09:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2024-10-11 18:09:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:16,368 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:09:16,368 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:09:16,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=601, Unknown=2, NotChecked=102, Total=812 [2024-10-11 18:09:16,369 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 67 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:16,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 418 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 627 Invalid, 0 Unknown, 224 Unchecked, 0.4s Time] [2024-10-11 18:09:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:09:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-10-11 18:09:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 105 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-10-11 18:09:16,378 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 23 [2024-10-11 18:09:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:16,378 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-10-11 18:09:16,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:09:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-10-11 18:09:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:09:16,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:16,379 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] [2024-10-11 18:09:16,402 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:09:16,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:16,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:16,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash 121178125, now seen corresponding path program 1 times [2024-10-11 18:09:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:16,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911906018] [2024-10-11 18:09:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911906018] [2024-10-11 18:09:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911906018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936292546] [2024-10-11 18:09:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:17,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:17,091 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:09:17,092 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:09:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:17,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:09:17,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:17,278 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:09:17,320 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:09:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:17,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936292546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:09:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2024-10-11 18:09:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862533002] [2024-10-11 18:09:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:17,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:09:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:09:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:09:17,338 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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:09:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:17,486 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2024-10-11 18:09:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 24 [2024-10-11 18:09:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:17,487 INFO L225 Difference]: With dead ends: 126 [2024-10-11 18:09:17,487 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 18:09:17,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:09:17,488 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:17,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 513 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 18:09:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2024-10-11 18:09:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 106 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-11 18:09:17,493 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 24 [2024-10-11 18:09:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:17,494 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-11 18:09:17,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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:09:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-11 18:09:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:09:17,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:17,496 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] [2024-10-11 18:09:17,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:17,696 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,SelfDestructingSolverStorable14 [2024-10-11 18:09:17,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 121236201, now seen corresponding path program 1 times [2024-10-11 18:09:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474850572] [2024-10-11 18:09:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474850572] [2024-10-11 18:09:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474850572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:18,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351150589] [2024-10-11 18:09:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:18,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:18,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:18,247 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:09:18,249 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:09:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:18,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 18:09:18,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:18,333 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:09:18,427 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:09:18,431 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:09:18,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:09:18,503 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:09:18,608 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:09:18,616 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:09:18,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:09:18,789 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-10-11 18:09:18,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-10-11 18:09:18,798 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:09:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-10-11 18:09:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:18,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:19,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:19,540 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 526 treesize of output 524 [2024-10-11 18:09:19,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:19,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1277 treesize of output 1250 [2024-10-11 18:09:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351150589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:23,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2024-10-11 18:09:23,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207561468] [2024-10-11 18:09:23,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:09:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:09:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 18:09:23,316 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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:09:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:23,990 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2024-10-11 18:09:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:09:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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 24 [2024-10-11 18:09:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:23,992 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:09:23,992 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:09:23,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:09:23,994 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:23,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1204 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:09:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:09:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-11 18:09:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.5875) internal successors, (127), 107 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2024-10-11 18:09:23,999 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 24 [2024-10-11 18:09:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:23,999 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-10-11 18:09:24,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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:09:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2024-10-11 18:09:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:09:24,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:24,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:24,020 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:09:24,205 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,SelfDestructingSolverStorable15 [2024-10-11 18:09:24,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:24,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash -799220620, now seen corresponding path program 1 times [2024-10-11 18:09:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633054064] [2024-10-11 18:09:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 18:09:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:09:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633054064] [2024-10-11 18:09:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633054064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164155946] [2024-10-11 18:09:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:24,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:24,413 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:09:24,420 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:09:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:24,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:09:24,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:24,516 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:09:24,538 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:09:24,543 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 17 treesize of output 9 [2024-10-11 18:09:24,563 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-11 18:09:24,576 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:09:24,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-10-11 18:09:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 18:09:24,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164155946] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:24,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:09:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-10-11 18:09:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120446088] [2024-10-11 18:09:24,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:09:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:09:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:09:24,681 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:09:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:24,949 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2024-10-11 18:09:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:24,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27 [2024-10-11 18:09:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:24,950 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:09:24,950 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:09:24,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:09:24,951 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:24,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 515 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 490 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2024-10-11 18:09:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:09:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-10-11 18:09:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.575) internal successors, (126), 106 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-11 18:09:24,955 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 27 [2024-10-11 18:09:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:24,955 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-11 18:09:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:09:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-11 18:09:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:09:24,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:24,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:09:24,989 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:09:25,157 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,SelfDestructingSolverStorable16 [2024-10-11 18:09:25,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -799220619, now seen corresponding path program 1 times [2024-10-11 18:09:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106656380] [2024-10-11 18:09:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:25,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 18:09:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:09:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106656380] [2024-10-11 18:09:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106656380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574105481] [2024-10-11 18:09:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:25,433 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:09:25,448 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:09:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:25,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:09:25,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:25,576 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:09:25,592 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:09:25,599 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:09:25,606 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 17 treesize of output 9 [2024-10-11 18:09:25,631 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-11 18:09:25,644 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:09:25,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2024-10-11 18:09:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 18:09:25,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574105481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:25,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2024-10-11 18:09:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245800773] [2024-10-11 18:09:25,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:25,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:25,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:09:25,713 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:25,975 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2024-10-11 18:09:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:09:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-10-11 18:09:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:25,976 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:09:25,976 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:09:25,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:09:25,977 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:25,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 497 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2024-10-11 18:09:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:09:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-10-11 18:09:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 104 states have internal predecessors, (124), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2024-10-11 18:09:25,980 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 27 [2024-10-11 18:09:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:25,980 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2024-10-11 18:09:25,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:09:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2024-10-11 18:09:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:09:25,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:25,981 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] [2024-10-11 18:09:25,994 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:09:26,184 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,SelfDestructingSolverStorable17 [2024-10-11 18:09:26,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 543906283, now seen corresponding path program 1 times [2024-10-11 18:09:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982280320] [2024-10-11 18:09:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:26,705 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:09:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982280320] [2024-10-11 18:09:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982280320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591544153] [2024-10-11 18:09:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:26,708 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:09:26,710 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:09:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:26,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 18:09:26,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:26,846 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:09:26,870 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:09:26,879 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:09:26,892 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 19 treesize of output 18 [2024-10-11 18:09:26,901 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 19 treesize of output 18 [2024-10-11 18:09:27,050 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_61 Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| v_alloc_and_zero_internal_~pi~1.base_61 (select |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_61))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_61) 0) (= (store |c_old(#memory_$Pointer$#0.offset)| v_alloc_and_zero_internal_~pi~1.base_61 (select |c_#memory_$Pointer$#0.offset| v_alloc_and_zero_internal_~pi~1.base_61)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-10-11 18:09:27,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:27,063 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 16 [2024-10-11 18:09:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:27,067 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 16 [2024-10-11 18:09:27,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:09:27,076 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:09:27,178 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-10-11 18:09:27,178 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2024-10-11 18:09:27,205 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-10-11 18:09:27,205 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2024-10-11 18:09:27,372 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:09:27,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591544153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:27,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:09:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2024-10-11 18:09:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474173197] [2024-10-11 18:09:27,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:27,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:09:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:09:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:09:27,781 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 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:09:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:28,536 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2024-10-11 18:09:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:09:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 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 26 [2024-10-11 18:09:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:28,538 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:09:28,538 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:09:28,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=1061, Unknown=1, NotChecked=66, Total=1260 [2024-10-11 18:09:28,539 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 14 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:28,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 892 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 739 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-10-11 18:09:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:09:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-11 18:09:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 106 states have internal predecessors, (126), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2024-10-11 18:09:28,542 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 26 [2024-10-11 18:09:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:28,542 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2024-10-11 18:09:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 19 states have internal predecessors, (41), 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:09:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2024-10-11 18:09:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:09:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:28,543 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] [2024-10-11 18:09:28,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:09:28,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:28,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:28,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1292102199, now seen corresponding path program 1 times [2024-10-11 18:09:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054188743] [2024-10-11 18:09:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:28,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054188743] [2024-10-11 18:09:28,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054188743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:28,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:09:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136209436] [2024-10-11 18:09:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:28,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:09:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:09:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:09:28,819 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:09:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:28,967 INFO L93 Difference]: Finished difference Result 149 states and 178 transitions. [2024-10-11 18:09:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:09:28,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 28 [2024-10-11 18:09:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:28,968 INFO L225 Difference]: With dead ends: 149 [2024-10-11 18:09:28,968 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 18:09:28,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:09:28,969 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:28,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 18:09:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2024-10-11 18:09:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.6021505376344085) internal successors, (149), 117 states have internal predecessors, (149), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2024-10-11 18:09:28,973 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 28 [2024-10-11 18:09:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2024-10-11 18:09:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:09:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2024-10-11 18:09:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:09:28,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:28,974 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] [2024-10-11 18:09:28,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:09:28,975 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1292102198, now seen corresponding path program 1 times [2024-10-11 18:09:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852045638] [2024-10-11 18:09:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,143 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:09:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852045638] [2024-10-11 18:09:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852045638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015912794] [2024-10-11 18:09:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:29,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:29,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:29,145 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:09:29,147 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:09:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 18:09:29,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:29,253 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:09:29,258 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:09:29,343 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-11 18:09:29,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:29,353 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:09:29,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:09:29,360 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:09:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:29,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:09:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015912794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:29,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:09:29,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2024-10-11 18:09:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007795238] [2024-10-11 18:09:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:09:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:09:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:09:29,400 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 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:09:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:29,596 INFO L93 Difference]: Finished difference Result 148 states and 191 transitions. [2024-10-11 18:09:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:09:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 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 28 [2024-10-11 18:09:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:29,597 INFO L225 Difference]: With dead ends: 148 [2024-10-11 18:09:29,597 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 18:09:29,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:09:29,598 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:29,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 308 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 420 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2024-10-11 18:09:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 18:09:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2024-10-11 18:09:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 129 states have internal predecessors, (169), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2024-10-11 18:09:29,601 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 28 [2024-10-11 18:09:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2024-10-11 18:09:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (2), 2 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:09:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2024-10-11 18:09:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:09:29,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:29,602 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] [2024-10-11 18:09:29,616 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:09:29,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:29,803 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:29,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463065, now seen corresponding path program 1 times [2024-10-11 18:09:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:29,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368036673] [2024-10-11 18:09:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:29,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368036673] [2024-10-11 18:09:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368036673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:29,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:09:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75777278] [2024-10-11 18:09:29,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:09:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:09:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:09:29,901 INFO L87 Difference]: Start difference. First operand 141 states and 187 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:09:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:30,051 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-10-11 18:09:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:09:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 29 [2024-10-11 18:09:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:30,053 INFO L225 Difference]: With dead ends: 162 [2024-10-11 18:09:30,053 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 18:09:30,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:09:30,054 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:30,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 417 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:09:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 18:09:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2024-10-11 18:09:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 106 states have (on average 1.5849056603773586) internal successors, (168), 130 states have internal predecessors, (168), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 18:09:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2024-10-11 18:09:30,058 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 29 [2024-10-11 18:09:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:30,059 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2024-10-11 18:09:30,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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:09:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2024-10-11 18:09:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:09:30,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:30,060 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:09:30,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:09:30,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:30,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash 906147695, now seen corresponding path program 1 times [2024-10-11 18:09:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862374860] [2024-10-11 18:09:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:09:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862374860] [2024-10-11 18:09:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862374860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531415045] [2024-10-11 18:09:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:30,391 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:09:30,399 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:09:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:30,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:09:30,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:30,579 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:09:30,607 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 21 treesize of output 9 [2024-10-11 18:09:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:09:30,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:30,620 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 34 treesize of output 28 [2024-10-11 18:09:30,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:30,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-10-11 18:09:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:09:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531415045] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:30,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:09:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-11 18:09:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771946811] [2024-10-11 18:09:30,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:09:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:09:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:09:30,729 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:09:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:31,027 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2024-10-11 18:09:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:09:31,028 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-10-11 18:09:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:31,029 INFO L225 Difference]: With dead ends: 182 [2024-10-11 18:09:31,029 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 18:09:31,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:09:31,029 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:31,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 833 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 18:09:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2024-10-11 18:09:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 142 states have internal predecessors, (183), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2024-10-11 18:09:31,033 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 30 [2024-10-11 18:09:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2024-10-11 18:09:31,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:09:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2024-10-11 18:09:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:09:31,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:31,034 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:09:31,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:09:31,238 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,SelfDestructingSolverStorable22 [2024-10-11 18:09:31,239 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash 906147696, now seen corresponding path program 1 times [2024-10-11 18:09:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002030956] [2024-10-11 18:09:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002030956] [2024-10-11 18:09:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002030956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771528944] [2024-10-11 18:09:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:31,612 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:09:31,613 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:09:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:31,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:09:31,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:31,866 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:09:31,870 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:09:31,924 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 21 treesize of output 9 [2024-10-11 18:09:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:31,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:32,005 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 70 treesize of output 64 [2024-10-11 18:09:32,007 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 94 treesize of output 82 [2024-10-11 18:09:32,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:32,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:09:32,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:32,072 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 25 treesize of output 29 [2024-10-11 18:09:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:32,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771528944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:09:32,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:09:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2024-10-11 18:09:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137448754] [2024-10-11 18:09:32,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:09:32,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:09:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:32,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:09:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:09:32,311 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 18:09:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:32,721 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2024-10-11 18:09:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:09:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2024-10-11 18:09:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:32,723 INFO L225 Difference]: With dead ends: 166 [2024-10-11 18:09:32,723 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 18:09:32,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:09:32,723 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:32,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1064 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:09:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 18:09:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2024-10-11 18:09:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.5423728813559323) internal successors, (182), 142 states have internal predecessors, (182), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2024-10-11 18:09:32,729 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 30 [2024-10-11 18:09:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2024-10-11 18:09:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 18:09:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2024-10-11 18:09:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:09:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:32,730 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-10-11 18:09:32,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:09:32,934 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,SelfDestructingSolverStorable23 [2024-10-11 18:09:32,935 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:32,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1114051057, now seen corresponding path program 1 times [2024-10-11 18:09:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:32,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145193792] [2024-10-11 18:09:32,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 18:09:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:09:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:09:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145193792] [2024-10-11 18:09:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145193792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:09:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262540240] [2024-10-11 18:09:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:33,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:09:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:09:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:09:33,182 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:09:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:33,423 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2024-10-11 18:09:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:09:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-11 18:09:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:33,424 INFO L225 Difference]: With dead ends: 170 [2024-10-11 18:09:33,424 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 18:09:33,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:09:33,426 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:33,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 379 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:09:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 18:09:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2024-10-11 18:09:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.5476190476190477) internal successors, (195), 150 states have internal predecessors, (195), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 215 transitions. [2024-10-11 18:09:33,433 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 215 transitions. Word has length 32 [2024-10-11 18:09:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:33,434 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 215 transitions. [2024-10-11 18:09:33,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:09:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 215 transitions. [2024-10-11 18:09:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:09:33,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:33,434 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-10-11 18:09:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:09:33,435 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1114051056, now seen corresponding path program 1 times [2024-10-11 18:09:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956321319] [2024-10-11 18:09:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 18:09:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:09:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956321319] [2024-10-11 18:09:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956321319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:09:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409431213] [2024-10-11 18:09:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:09:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:09:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:09:33,825 INFO L87 Difference]: Start difference. First operand 163 states and 215 transitions. Second operand has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:09:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:34,117 INFO L93 Difference]: Finished difference Result 165 states and 217 transitions. [2024-10-11 18:09:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:09:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-11 18:09:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:34,122 INFO L225 Difference]: With dead ends: 165 [2024-10-11 18:09:34,122 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 18:09:34,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:09:34,123 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:34,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 335 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:09:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 18:09:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-11 18:09:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 150 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2024-10-11 18:09:34,130 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 32 [2024-10-11 18:09:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2024-10-11 18:09:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:09:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2024-10-11 18:09:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:09:34,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:34,133 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, 1] [2024-10-11 18:09:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:09:34,133 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:34,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1517497877, now seen corresponding path program 1 times [2024-10-11 18:09:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:34,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736879052] [2024-10-11 18:09:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:34,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736879052] [2024-10-11 18:09:34,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736879052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:34,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:34,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:09:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467035911] [2024-10-11 18:09:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:09:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:09:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:09:34,423 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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:09:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:34,675 INFO L93 Difference]: Finished difference Result 174 states and 220 transitions. [2024-10-11 18:09:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:09:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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 31 [2024-10-11 18:09:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:34,677 INFO L225 Difference]: With dead ends: 174 [2024-10-11 18:09:34,677 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 18:09:34,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:09:34,678 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:34,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 478 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:09:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 18:09:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-10-11 18:09:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 150 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2024-10-11 18:09:34,682 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 31 [2024-10-11 18:09:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2024-10-11 18:09:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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:09:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2024-10-11 18:09:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:09:34,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:34,684 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, 1] [2024-10-11 18:09:34,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:09:34,684 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1517497876, now seen corresponding path program 1 times [2024-10-11 18:09:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:34,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882263302] [2024-10-11 18:09:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:34,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:09:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882263302] [2024-10-11 18:09:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882263302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:09:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:09:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 18:09:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026035696] [2024-10-11 18:09:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:09:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:09:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:09:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:09:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:09:35,084 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:09:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:09:35,414 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2024-10-11 18:09:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:09:35,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 31 [2024-10-11 18:09:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:09:35,416 INFO L225 Difference]: With dead ends: 173 [2024-10-11 18:09:35,416 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 18:09:35,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:09:35,417 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:09:35,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 574 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:09:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 18:09:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-10-11 18:09:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.5078125) internal successors, (193), 151 states have internal predecessors, (193), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 18:09:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2024-10-11 18:09:35,421 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 31 [2024-10-11 18:09:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:09:35,421 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2024-10-11 18:09:35,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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:09:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2024-10-11 18:09:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:09:35,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:09:35,422 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] [2024-10-11 18:09:35,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:09:35,423 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-10-11 18:09:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:09:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1070334003, now seen corresponding path program 1 times [2024-10-11 18:09:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:09:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328476805] [2024-10-11 18:09:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:09:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:09:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 18:09:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 18:09:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:09:35,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:09:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328476805] [2024-10-11 18:09:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328476805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:09:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961125143] [2024-10-11 18:09:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:09:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:09:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:09:35,985 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:09:35,989 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:09:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:09:36,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 18:09:36,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:09:36,142 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:09:36,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:09:36,241 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:09:36,320 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:09:36,392 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 15 treesize of output 1 [2024-10-11 18:09:36,469 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:09:36,474 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 35 treesize of output 19 [2024-10-11 18:09:36,548 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 3 [2024-10-11 18:09:36,615 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:09:36,615 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 39 treesize of output 16 [2024-10-11 18:09:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:09:36,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:09:36,799 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 30 treesize of output 24 [2024-10-11 18:09:47,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:09:47,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3119 treesize of output 2930