./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-middle-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:53:14,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:53:15,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:53:15,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:53:15,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:53:15,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:53:15,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:53:15,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:53:15,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:53:15,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:53:15,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:53:15,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:53:15,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:53:15,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:53:15,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:53:15,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:53:15,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:53:15,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:53:15,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:53:15,044 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:53:15,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:53:15,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:53:15,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:53:15,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:53:15,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:53:15,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:53:15,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:53:15,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:53:15,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:15,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:53:15,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:53:15,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:53:15,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:53:15,048 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/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/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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2024-11-19 06:53:15,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:53:15,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:53:15,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:53:15,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:53:15,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:53:15,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-19 06:53:16,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:53:16,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:53:16,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-19 06:53:16,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8899aa9c/46d9aa1925494a3f9cdf1a878aa92d4e/FLAG0787e21f8 [2024-11-19 06:53:16,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8899aa9c/46d9aa1925494a3f9cdf1a878aa92d4e [2024-11-19 06:53:16,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:53:16,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:53:16,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:16,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:53:16,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:53:16,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:16" (1/1) ... [2024-11-19 06:53:16,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641e74bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:16, skipping insertion in model container [2024-11-19 06:53:16,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:16" (1/1) ... [2024-11-19 06:53:16,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:53:17,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:17,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:53:17,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:17,117 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:53:17,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17 WrapperNode [2024-11-19 06:53:17,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:17,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:17,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:53:17,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:53:17,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,159 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2024-11-19 06:53:17,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:17,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:53:17,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:53:17,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:53:17,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,197 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-19 06:53:17,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:53:17,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:53:17,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:53:17,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:53:17,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (1/1) ... [2024-11-19 06:53:17,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:17,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:17,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:53:17,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:53:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:53:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-19 06:53:17,292 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-19 06:53:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:53:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:53:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:53:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:53:17,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:53:17,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:53:17,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:53:17,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:53:17,609 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-19 06:53:17,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:53:17,622 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:53:17,622 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:53:17,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:17 BoogieIcfgContainer [2024-11-19 06:53:17,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:53:17,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:53:17,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:53:17,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:53:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:53:16" (1/3) ... [2024-11-19 06:53:17,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa56aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:17, skipping insertion in model container [2024-11-19 06:53:17,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:17" (2/3) ... [2024-11-19 06:53:17,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa56aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:17, skipping insertion in model container [2024-11-19 06:53:17,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:17" (3/3) ... [2024-11-19 06:53:17,630 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2024-11-19 06:53:17,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:53:17,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-19 06:53:17,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:53:17,681 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;@69bb246d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:53:17,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-19 06:53:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 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-11-19 06:53:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:53:17,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:17,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:53:17,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:17,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash 34510473, now seen corresponding path program 1 times [2024-11-19 06:53:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:17,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734833524] [2024-11-19 06:53:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:17,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734833524] [2024-11-19 06:53:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734833524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:17,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:17,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290840162] [2024-11-19 06:53:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:17,969 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 06:53:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:18,020 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2024-11-19 06:53:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:53:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:18,033 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:53:18,033 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:53:18,035 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-11-19 06:53:18,038 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:18,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:53:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-19 06:53:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.675) internal successors, (67), 64 states have internal predecessors, (67), 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-11-19 06:53:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-19 06:53:18,072 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5 [2024-11-19 06:53:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:18,072 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-19 06:53:18,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 06:53:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-19 06:53:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:53:18,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:18,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:53:18,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:53:18,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 34510474, now seen corresponding path program 1 times [2024-11-19 06:53:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:18,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380036887] [2024-11-19 06:53:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:18,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380036887] [2024-11-19 06:53:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380036887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103438719] [2024-11-19 06:53:18,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:18,148 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 06:53:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:18,187 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-19 06:53:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-19 06:53:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:18,189 INFO L225 Difference]: With dead ends: 67 [2024-11-19 06:53:18,189 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:53:18,190 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-11-19 06:53:18,191 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:18,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:53:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-19 06:53:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.65) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-19 06:53:18,195 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 5 [2024-11-19 06:53:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-19 06:53:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-19 06:53:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-19 06:53:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:53:18,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:18,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:18,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:53:18,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:18,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash -168921788, now seen corresponding path program 1 times [2024-11-19 06:53:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:18,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121331270] [2024-11-19 06:53:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121331270] [2024-11-19 06:53:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121331270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:53:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329012658] [2024-11-19 06:53:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:53:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:53:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:18,289 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:18,414 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-19 06:53:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:53:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:18,416 INFO L225 Difference]: With dead ends: 67 [2024-11-19 06:53:18,416 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:53:18,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:18,417 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:18,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:53:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-11-19 06:53:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.525) internal successors, (61), 58 states have internal predecessors, (61), 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-11-19 06:53:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-19 06:53:18,424 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2024-11-19 06:53:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-19 06:53:18,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-19 06:53:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:53:18,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:18,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:53:18,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -168921787, now seen corresponding path program 1 times [2024-11-19 06:53:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478440858] [2024-11-19 06:53:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478440858] [2024-11-19 06:53:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478440858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:18,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92573350] [2024-11-19 06:53:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:18,625 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:18,706 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-19 06:53:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:18,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:53:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:18,708 INFO L225 Difference]: With dead ends: 66 [2024-11-19 06:53:18,708 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 06:53:18,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:18,730 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:18,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 220 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 06:53:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-11-19 06:53:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.5) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-11-19 06:53:18,740 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 10 [2024-11-19 06:53:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:18,743 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-11-19 06:53:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-11-19 06:53:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:53:18,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:18,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:53:18,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 874918470, now seen corresponding path program 1 times [2024-11-19 06:53:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469583987] [2024-11-19 06:53:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469583987] [2024-11-19 06:53:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469583987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:53:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662853068] [2024-11-19 06:53:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:18,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:53:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:53:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:18,907 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:18,992 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2024-11-19 06:53:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:53:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:18,993 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:53:18,993 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 06:53:18,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:18,996 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:18,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 06:53:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-11-19 06:53:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.475) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-11-19 06:53:19,003 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 12 [2024-11-19 06:53:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-19 06:53:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2024-11-19 06:53:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:53:19,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,004 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-11-19 06:53:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:53:19,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1406976365, now seen corresponding path program 1 times [2024-11-19 06:53:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171299163] [2024-11-19 06:53:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171299163] [2024-11-19 06:53:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171299163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:53:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131572578] [2024-11-19 06:53:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:53:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:53:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:19,122 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,230 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-19 06:53:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 06:53:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,231 INFO L225 Difference]: With dead ends: 68 [2024-11-19 06:53:19,231 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:53:19,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-19 06:53:19,232 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:53:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-19 06:53:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 63 states have internal predecessors, (69), 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-11-19 06:53:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-19 06:53:19,239 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2024-11-19 06:53:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,239 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-19 06:53:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-19 06:53:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:53:19,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,240 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-11-19 06:53:19,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:53:19,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1406976364, now seen corresponding path program 1 times [2024-11-19 06:53:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389681820] [2024-11-19 06:53:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389681820] [2024-11-19 06:53:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389681820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:53:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498151126] [2024-11-19 06:53:19,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:53:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:53:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:19,440 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,537 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-19 06:53:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 06:53:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,538 INFO L225 Difference]: With dead ends: 68 [2024-11-19 06:53:19,538 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:53:19,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-19 06:53:19,539 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:53:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-19 06:53:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.446808510638298) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-19 06:53:19,544 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2024-11-19 06:53:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-19 06:53:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-19 06:53:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:19,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:53:19,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash -666645695, now seen corresponding path program 1 times [2024-11-19 06:53:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238065345] [2024-11-19 06:53:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238065345] [2024-11-19 06:53:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238065345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103884755] [2024-11-19 06:53:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:53:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:53:19,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:19,624 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:19,659 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-19 06:53:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 06:53:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:19,660 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:53:19,660 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 06:53:19,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:19,661 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:19,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 352 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 06:53:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-19 06:53:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-19 06:53:19,668 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2024-11-19 06:53:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:19,669 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-19 06:53:19,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-19 06:53:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:53:19,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:19,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:53:19,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 561056622, now seen corresponding path program 1 times [2024-11-19 06:53:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064207635] [2024-11-19 06:53:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064207635] [2024-11-19 06:53:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064207635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212684202] [2024-11-19 06:53:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:19,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:19,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:19,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:53:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:20,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:53:20,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:20,172 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-19 06:53:20,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:20,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:53:20,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:20,243 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-11-19 06:53:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:20,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212684202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-19 06:53:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447600253] [2024-11-19 06:53:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:20,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2024-11-19 06:53:20,263 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-19 06:53:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:20,335 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-19 06:53:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:20,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2024-11-19 06:53:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:20,336 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:53:20,336 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:53:20,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2024-11-19 06:53:20,337 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:20,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2024-11-19 06:53:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:53:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-19 06:53:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.423728813559322) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-19 06:53:20,343 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 22 [2024-11-19 06:53:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:20,343 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-19 06:53:20,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-19 06:53:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-19 06:53:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:53:20,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:20,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:20,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:53:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:20,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash 561056621, now seen corresponding path program 1 times [2024-11-19 06:53:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547176768] [2024-11-19 06:53:20,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547176768] [2024-11-19 06:53:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547176768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052880284] [2024-11-19 06:53:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:20,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:20,675 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-11-19 06:53:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:20,759 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-19 06:53:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 22 [2024-11-19 06:53:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:20,760 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:53:20,760 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:53:20,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:20,761 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:20,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:53:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 06:53:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-19 06:53:20,768 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 22 [2024-11-19 06:53:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:20,769 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-19 06:53:20,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-11-19 06:53:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-19 06:53:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:20,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:20,769 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:53:20,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:20,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1417695502, now seen corresponding path program 1 times [2024-11-19 06:53:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406369574] [2024-11-19 06:53:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406369574] [2024-11-19 06:53:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406369574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018710346] [2024-11-19 06:53:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:21,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:21,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:21,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:53:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:21,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 06:53:21,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:21,301 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-11-19 06:53:21,304 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-11-19 06:53:21,397 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 25 treesize of output 13 [2024-11-19 06:53:21,404 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 25 treesize of output 13 [2024-11-19 06:53:21,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:53:21,433 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 29 treesize of output 13 [2024-11-19 06:53:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:21,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018710346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:21,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 21 [2024-11-19 06:53:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476763978] [2024-11-19 06:53:21,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:53:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:21,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:53:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:53:21,761 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:21,945 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-19 06:53:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 06:53:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:21,947 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:53:21,947 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:53:21,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:53:21,948 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:21,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 632 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:53:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 06:53:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-19 06:53:21,954 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24 [2024-11-19 06:53:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:21,954 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-19 06:53:21,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-19 06:53:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:53:21,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:21,956 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] [2024-11-19 06:53:21,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:22,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 06:53:22,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:22,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash 998836262, now seen corresponding path program 1 times [2024-11-19 06:53:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827972696] [2024-11-19 06:53:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:22,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827972696] [2024-11-19 06:53:22,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827972696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181895445] [2024-11-19 06:53:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:22,244 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:22,362 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-19 06:53:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:22,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 06:53:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:22,363 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:53:22,363 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:53:22,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:22,364 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:22,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:53:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 06:53:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.390625) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-19 06:53:22,367 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2024-11-19 06:53:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:22,367 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-19 06:53:22,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-19 06:53:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:53:22,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:22,368 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] [2024-11-19 06:53:22,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:53:22,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:22,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash 998836263, now seen corresponding path program 1 times [2024-11-19 06:53:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241752028] [2024-11-19 06:53:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241752028] [2024-11-19 06:53:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241752028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863422712] [2024-11-19 06:53:22,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:22,523 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:22,647 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-19 06:53:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 06:53:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:22,648 INFO L225 Difference]: With dead ends: 86 [2024-11-19 06:53:22,648 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 06:53:22,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:22,649 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:22,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 06:53:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 06:53:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-19 06:53:22,657 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 25 [2024-11-19 06:53:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:22,659 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-19 06:53:22,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-19 06:53:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:53:22,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:22,660 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] [2024-11-19 06:53:22,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:53:22,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1577780753, now seen corresponding path program 1 times [2024-11-19 06:53:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323808708] [2024-11-19 06:53:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:53:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323808708] [2024-11-19 06:53:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323808708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824882649] [2024-11-19 06:53:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:22,734 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:22,812 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-19 06:53:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:53:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:22,813 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:53:22,813 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 06:53:22,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-19 06:53:22,814 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:22,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 06:53:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 06:53:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-19 06:53:22,816 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 26 [2024-11-19 06:53:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-19 06:53:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-19 06:53:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:53:22,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:22,817 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] [2024-11-19 06:53:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:53:22,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1577780752, now seen corresponding path program 1 times [2024-11-19 06:53:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132827148] [2024-11-19 06:53:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132827148] [2024-11-19 06:53:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132827148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:22,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:22,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129206243] [2024-11-19 06:53:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:22,984 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:23,084 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-19 06:53:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:23,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:53:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:23,085 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:53:23,085 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:53:23,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:23,086 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:23,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:53:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 06:53:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-19 06:53:23,091 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 26 [2024-11-19 06:53:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:23,091 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-19 06:53:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-19 06:53:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:53:23,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:23,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:53:23,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:23,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 899151603, now seen corresponding path program 1 times [2024-11-19 06:53:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562747184] [2024-11-19 06:53:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562747184] [2024-11-19 06:53:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562747184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:23,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:53:23,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949553058] [2024-11-19 06:53:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:23,161 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:23,209 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-19 06:53:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 06:53:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:23,211 INFO L225 Difference]: With dead ends: 91 [2024-11-19 06:53:23,211 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 06:53:23,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:23,212 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:23,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 354 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 06:53:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-19 06:53:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-19 06:53:23,215 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 26 [2024-11-19 06:53:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-19 06:53:23,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-19 06:53:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:53:23,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:23,216 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-11-19 06:53:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:53:23,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 797715191, now seen corresponding path program 1 times [2024-11-19 06:53:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177400303] [2024-11-19 06:53:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177400303] [2024-11-19 06:53:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177400303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644211646] [2024-11-19 06:53:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:23,301 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:23,365 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-19 06:53:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 06:53:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:23,366 INFO L225 Difference]: With dead ends: 90 [2024-11-19 06:53:23,366 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 06:53:23,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:23,367 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:23,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 322 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 06:53:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-19 06:53:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-19 06:53:23,369 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2024-11-19 06:53:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:23,369 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-19 06:53:23,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-19 06:53:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:23,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:23,370 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] [2024-11-19 06:53:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:53:23,370 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1241356658, now seen corresponding path program 1 times [2024-11-19 06:53:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242539272] [2024-11-19 06:53:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:23,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242539272] [2024-11-19 06:53:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242539272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799213660] [2024-11-19 06:53:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:23,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:23,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:23,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:53:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:23,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:53:23,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:23,800 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-11-19 06:53:23,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:23,834 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-11-19 06:53:23,847 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-11-19 06:53:23,850 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-11-19 06:53:23,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:23,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:53:23,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 06:53:23,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 06:53:23,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 06:53:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:23,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799213660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 14 [2024-11-19 06:53:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819384418] [2024-11-19 06:53:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:53:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:53:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:53:23,946 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-11-19 06:53:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:24,094 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-19 06:53:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:53:24,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 30 [2024-11-19 06:53:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:24,095 INFO L225 Difference]: With dead ends: 90 [2024-11-19 06:53:24,095 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 06:53:24,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:53:24,095 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 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-11-19 06:53:24,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 06:53:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-19 06:53:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.295774647887324) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-19 06:53:24,098 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 30 [2024-11-19 06:53:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:24,098 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-19 06:53:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-11-19 06:53:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-19 06:53:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:53:24,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:24,099 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] [2024-11-19 06:53:24,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:53:24,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:53:24,303 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1241356657, now seen corresponding path program 1 times [2024-11-19 06:53:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601800304] [2024-11-19 06:53:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601800304] [2024-11-19 06:53:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601800304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:24,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:24,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 06:53:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423424559] [2024-11-19 06:53:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:24,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:53:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:24,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:53:24,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:53:24,530 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-11-19 06:53:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:24,676 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-19 06:53:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2024-11-19 06:53:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:24,677 INFO L225 Difference]: With dead ends: 89 [2024-11-19 06:53:24,677 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:53:24,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:53:24,677 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:24,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 318 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:53:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 06:53:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-19 06:53:24,680 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2024-11-19 06:53:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:24,680 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-19 06:53:24,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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-11-19 06:53:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-19 06:53:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:53:24,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:24,681 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:24,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:53:24,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 679332107, now seen corresponding path program 1 times [2024-11-19 06:53:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320217950] [2024-11-19 06:53:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320217950] [2024-11-19 06:53:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320217950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300274290] [2024-11-19 06:53:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:24,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:24,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:24,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:24,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:53:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:25,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 06:53:25,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:25,070 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-11-19 06:53:25,075 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-11-19 06:53:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:53:25,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:53:25,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:53:25,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:53:25,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:25,308 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 17 treesize of output 15 [2024-11-19 06:53:25,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:25,312 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 17 treesize of output 15 [2024-11-19 06:53:25,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-11-19 06:53:25,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:25,773 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 18 [2024-11-19 06:53:25,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2024-11-19 06:53:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300274290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:25,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 31 [2024-11-19 06:53:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650537370] [2024-11-19 06:53:25,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:53:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:25,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:53:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:53:25,784 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:26,269 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2024-11-19 06:53:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:53:26,270 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-19 06:53:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:26,271 INFO L225 Difference]: With dead ends: 103 [2024-11-19 06:53:26,271 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:53:26,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 06:53:26,272 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:26,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 660 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:53:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:53:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-19 06:53:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 94 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-19 06:53:26,278 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 31 [2024-11-19 06:53:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-19 06:53:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-19 06:53:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:53:26,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:26,279 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, 1] [2024-11-19 06:53:26,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:26,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:26,483 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash -415542610, now seen corresponding path program 1 times [2024-11-19 06:53:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:26,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358472936] [2024-11-19 06:53:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358472936] [2024-11-19 06:53:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358472936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22732624] [2024-11-19 06:53:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:26,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:26,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:53:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:26,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:53:26,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:26,733 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 13 treesize of output 9 [2024-11-19 06:53:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:26,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:26,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-19 06:53:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22732624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:26,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:26,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2024-11-19 06:53:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208558759] [2024-11-19 06:53:26,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:26,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:53:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:53:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:53:26,801 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:26,959 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-19 06:53:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 06:53:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:26,960 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:53:26,960 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:53:26,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:53:26,960 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:26,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:53:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 06:53:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-11-19 06:53:26,962 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2024-11-19 06:53:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:26,963 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-19 06:53:26,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2024-11-19 06:53:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:53:26,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:26,963 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:26,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:53:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:27,168 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1376283299, now seen corresponding path program 1 times [2024-11-19 06:53:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672303] [2024-11-19 06:53:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:53:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672303] [2024-11-19 06:53:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845098699] [2024-11-19 06:53:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:27,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:27,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:27,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:27,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:53:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:27,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:53:27,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:53:27,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:27,416 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:53:27,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-19 06:53:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:53:27,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845098699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:27,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:27,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-19 06:53:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475190024] [2024-11-19 06:53:27,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:27,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:27,435 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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-11-19 06:53:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:27,500 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-11-19 06:53:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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 40 [2024-11-19 06:53:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:27,502 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:53:27,502 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:53:27,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:27,503 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:27,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:53:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-19 06:53:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 92 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2024-11-19 06:53:27,506 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 40 [2024-11-19 06:53:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:27,507 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2024-11-19 06:53:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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-11-19 06:53:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2024-11-19 06:53:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:53:27,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:27,508 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:27,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:27,709 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:27,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1376283298, now seen corresponding path program 1 times [2024-11-19 06:53:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:27,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397546328] [2024-11-19 06:53:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:27,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397546328] [2024-11-19 06:53:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397546328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299874190] [2024-11-19 06:53:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:27,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:27,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:27,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:53:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:27,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:53:27,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:28,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:28,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:28,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-19 06:53:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299874190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:28,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-11-19 06:53:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620898232] [2024-11-19 06:53:28,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:53:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:53:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:53:28,353 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:53:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:28,460 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-19 06:53:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:53:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-19 06:53:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:28,462 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:53:28,462 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:53:28,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:53:28,463 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:28,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 441 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:53:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-19 06:53:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 92 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-19 06:53:28,465 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 40 [2024-11-19 06:53:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:28,465 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-19 06:53:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:53:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-19 06:53:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:28,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:28,466 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-19 06:53:28,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:53:28,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:28,669 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:28,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash -7678024, now seen corresponding path program 1 times [2024-11-19 06:53:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670770170] [2024-11-19 06:53:28,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:29,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:29,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670770170] [2024-11-19 06:53:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670770170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139300161] [2024-11-19 06:53:29,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:29,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:29,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:29,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:29,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:53:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:29,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 06:53:29,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:29,299 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-11-19 06:53:29,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:29,328 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-11-19 06:53:29,336 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-11-19 06:53:29,340 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-11-19 06:53:29,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:29,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:53:29,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 06:53:29,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:29,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:53:29,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 06:53:29,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 06:53:29,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 06:53:29,488 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2024-11-19 06:53:29,503 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:53:29,503 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-11-19 06:53:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:53:29,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:29,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139300161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:29,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:29,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 21 [2024-11-19 06:53:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877103208] [2024-11-19 06:53:29,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:29,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:53:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:53:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-11-19 06:53:29,592 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:53:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:29,945 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-19 06:53:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:53:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-19 06:53:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:29,946 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:53:29,946 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:53:29,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=770, Unknown=1, NotChecked=56, Total=930 [2024-11-19 06:53:29,947 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:29,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 585 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 545 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-19 06:53:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:53:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-19 06:53:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 103 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2024-11-19 06:53:29,949 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 42 [2024-11-19 06:53:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:29,950 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2024-11-19 06:53:29,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:53:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2024-11-19 06:53:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:29,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:29,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-19 06:53:29,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:53:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 06:53:30,155 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -7678025, now seen corresponding path program 1 times [2024-11-19 06:53:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642676816] [2024-11-19 06:53:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:53:30,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642676816] [2024-11-19 06:53:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642676816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470874569] [2024-11-19 06:53:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:30,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:30,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:53:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:30,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 06:53:30,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:30,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:30,688 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-11-19 06:53:30,705 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-11-19 06:53:30,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:30,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 06:53:30,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:30,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 06:53:30,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 06:53:30,798 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-11-19 06:53:30,814 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:53:30,815 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-11-19 06:53:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-19 06:53:30,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:30,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1020 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_1020) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 06:53:30,949 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 06:53:30,950 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 33 treesize of output 32 [2024-11-19 06:53:30,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1019))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1020)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-11-19 06:53:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470874569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:31,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 30 [2024-11-19 06:53:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569618840] [2024-11-19 06:53:31,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:31,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:53:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:53:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=662, Unknown=17, NotChecked=162, Total=930 [2024-11-19 06:53:31,059 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 06:53:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:31,353 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2024-11-19 06:53:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:31,353 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2024-11-19 06:53:31,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:31,354 INFO L225 Difference]: With dead ends: 107 [2024-11-19 06:53:31,354 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 06:53:31,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=976, Unknown=17, NotChecked=198, Total=1332 [2024-11-19 06:53:31,355 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:31,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 560 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 444 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2024-11-19 06:53:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 06:53:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 06:53:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 101 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-19 06:53:31,357 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 42 [2024-11-19 06:53:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:31,358 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-19 06:53:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 26 states have internal predecessors, (74), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 06:53:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-11-19 06:53:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:53:31,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:31,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:31,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:31,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 06:53:31,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash 324547288, now seen corresponding path program 1 times [2024-11-19 06:53:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296975724] [2024-11-19 06:53:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296975724] [2024-11-19 06:53:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296975724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563638212] [2024-11-19 06:53:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:32,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:32,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:53:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:32,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 06:53:32,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:32,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:32,329 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-11-19 06:53:32,362 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-11-19 06:53:32,368 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-11-19 06:53:32,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 06:53:32,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:32,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-19 06:53:32,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:32,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 06:53:32,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 06:53:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:32,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:32,742 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 06:53:32,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 06:53:32,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1120) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)))) is different from false [2024-11-19 06:53:32,979 INFO L349 Elim1Store]: treesize reduction 19, result has 68.3 percent of original size [2024-11-19 06:53:32,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2024-11-19 06:53:33,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:33,004 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 162 [2024-11-19 06:53:33,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-19 06:53:33,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:33,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2024-11-19 06:53:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563638212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:33,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2024-11-19 06:53:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916802033] [2024-11-19 06:53:33,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:33,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:53:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:33,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:53:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1711, Unknown=39, NotChecked=84, Total=1980 [2024-11-19 06:53:33,354 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 31 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:33,837 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2024-11-19 06:53:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:53:33,838 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 31 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-11-19 06:53:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:33,838 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:53:33,838 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:53:33,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=2482, Unknown=40, NotChecked=102, Total=2862 [2024-11-19 06:53:33,839 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:33,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 902 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:53:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:53:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 06:53:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 105 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2024-11-19 06:53:33,843 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 44 [2024-11-19 06:53:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:33,843 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2024-11-19 06:53:33,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 31 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2024-11-19 06:53:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:53:33,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:33,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:33,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 06:53:34,044 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 324547289, now seen corresponding path program 1 times [2024-11-19 06:53:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187676376] [2024-11-19 06:53:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187676376] [2024-11-19 06:53:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187676376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924880317] [2024-11-19 06:53:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:34,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:34,693 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:34,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:53:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:34,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 06:53:34,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:34,929 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-11-19 06:53:34,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:34,992 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-11-19 06:53:35,032 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-11-19 06:53:35,035 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-11-19 06:53:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:35,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41 [2024-11-19 06:53:35,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 06:53:35,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:35,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 06:53:35,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 06:53:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 06:53:35,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 06:53:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:35,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:35,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1220) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))) (forall ((v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))))) is different from false [2024-11-19 06:53:35,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))))) is different from false [2024-11-19 06:53:35,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1219 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse0 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1219)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse0 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1219)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1218) .cse3 v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1220) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))))) is different from false [2024-11-19 06:53:35,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse6 (select |c_#memory_$Pointer$#0.base| .cse1)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_25| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem9#1.offset_25|) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 (store .cse6 |v_ULTIMATE.start_create_#t~mem9#1.offset_25| v_ArrVal_1219)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_1218) .cse2 v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1220) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_25| Int)) (or (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1219 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 (store .cse6 |v_ULTIMATE.start_create_#t~mem9#1.offset_25| v_ArrVal_1219)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_1221) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) (< .cse0 |v_ULTIMATE.start_create_#t~mem9#1.offset_25|))))))) is different from false [2024-11-19 06:53:35,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:35,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2024-11-19 06:53:35,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:35,610 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 208 treesize of output 195 [2024-11-19 06:53:35,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-19 06:53:35,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2024-11-19 06:53:35,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:35,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 135 [2024-11-19 06:53:35,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:53:35,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:35,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-19 06:53:35,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:53:35,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:35,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 06:53:35,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:53:35,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:35,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 06:53:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924880317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:35,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2024-11-19 06:53:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908841017] [2024-11-19 06:53:35,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:35,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:53:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:53:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1663, Unknown=4, NotChecked=340, Total=2162 [2024-11-19 06:53:35,826 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:36,223 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-19 06:53:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:53:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-11-19 06:53:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:36,224 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:53:36,224 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:53:36,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=2332, Unknown=4, NotChecked=404, Total=2970 [2024-11-19 06:53:36,225 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:36,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 678 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:53:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 06:53:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 105 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-19 06:53:36,228 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 44 [2024-11-19 06:53:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:36,228 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-19 06:53:36,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-19 06:53:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:53:36,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:36,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:36,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:53:36,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 06:53:36,433 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:36,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1470979996, now seen corresponding path program 1 times [2024-11-19 06:53:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:36,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70487282] [2024-11-19 06:53:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:53:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70487282] [2024-11-19 06:53:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70487282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187364801] [2024-11-19 06:53:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:36,507 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:36,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 06:53:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:36,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 06:53:36,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:36,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:36,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:36,787 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-11-19 06:53:36,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-19 06:53:36,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 06:53:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:36,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2024-11-19 06:53:36,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-19 06:53:37,071 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 12 [2024-11-19 06:53:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:37,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:37,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_1322) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) 0))) is different from false [2024-11-19 06:53:37,416 INFO L349 Elim1Store]: treesize reduction 19, result has 68.3 percent of original size [2024-11-19 06:53:37,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 103 [2024-11-19 06:53:37,456 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-19 06:53:37,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 125 [2024-11-19 06:53:37,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:37,470 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 106 treesize of output 108 [2024-11-19 06:53:37,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2024-11-19 06:53:37,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:53:37,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:53:37,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:53:37,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:53:37,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:53:37,645 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 06:53:37,647 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 06:53:37,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:37,661 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 36 treesize of output 36 [2024-11-19 06:53:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187364801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:37,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2024-11-19 06:53:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739195465] [2024-11-19 06:53:37,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:37,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:53:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:53:37,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1126, Unknown=29, NotChecked=68, Total=1332 [2024-11-19 06:53:37,765 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:38,216 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2024-11-19 06:53:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:53:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-19 06:53:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:38,218 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:53:38,218 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:53:38,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1852, Unknown=32, NotChecked=88, Total=2162 [2024-11-19 06:53:38,219 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:38,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 656 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:53:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:53:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-19 06:53:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 112 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:53:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-19 06:53:38,222 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 45 [2024-11-19 06:53:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-19 06:53:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-19 06:53:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:53:38,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:38,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:38,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 06:53:38,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 06:53:38,424 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 06:53:38,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1944558291, now seen corresponding path program 2 times [2024-11-19 06:53:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:38,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619793556] [2024-11-19 06:53:38,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:53:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:38,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:53:38,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:53:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619793556] [2024-11-19 06:53:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619793556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225286820] [2024-11-19 06:53:39,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:53:39,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:39,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:39,456 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:53:39,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 06:53:39,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:53:39,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:53:39,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-19 06:53:39,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:39,584 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-11-19 06:53:39,677 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-11-19 06:53:39,680 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-11-19 06:53:39,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:39,706 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-11-19 06:53:39,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-19 06:53:39,748 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-11-19 06:53:39,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:39,864 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-19 06:53:39,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60 [2024-11-19 06:53:39,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:39,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2024-11-19 06:53:39,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:39,962 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2024-11-19 06:53:39,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 68 [2024-11-19 06:53:39,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:39,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 29 [2024-11-19 06:53:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:40,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:40,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse1 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1427 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1427 .cse1)) v_ArrVal_1427)) (forall ((v_ArrVal_1428 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse4 .cse1 v_ArrVal_1428)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1427) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)))) (forall ((v_ArrVal_1427 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1427 .cse1)) v_ArrVal_1427)) (forall ((v_ArrVal_1428 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1427))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse4 .cse1 v_ArrVal_1428)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0)))))) is different from false [2024-11-19 06:53:40,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse6 (select |c_#memory_$Pointer$#0.base| .cse5)) (.cse4 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#0.offset| .cse5))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| .cse0) (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_1427 .cse2)) v_ArrVal_1427)) (forall ((v_ArrVal_1428 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse5 (store .cse6 .cse2 v_ArrVal_1428)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_1427) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4)) 0))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| .cse0) (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12))) (or (forall ((v_ArrVal_1428 Int)) (= (let ((.cse7 (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_1427))) (select (select .cse7 (select (select (store |c_#memory_$Pointer$#0.base| .cse5 (store .cse6 .cse8 v_ArrVal_1428)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)) (+ (select (select .cse7 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4))) 0)) (not (= (store .cse1 .cse8 (select v_ArrVal_1427 .cse8)) v_ArrVal_1427))))))))))) is different from false [2024-11-19 06:53:40,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1423)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1422)))) (let ((.cse3 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1427 (store (select .cse0 .cse2) .cse3 (select v_ArrVal_1427 .cse3)))) (forall ((v_ArrVal_1428 Int)) (= (select (let ((.cse4 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_1428)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store .cse0 .cse2 v_ArrVal_1427) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1423)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1422)))) (let ((.cse11 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1427 (store (select .cse9 .cse10) .cse11 (select v_ArrVal_1427 .cse11)))) (forall ((v_ArrVal_1428 Int)) (= (let ((.cse12 (store .cse9 .cse10 v_ArrVal_1427))) (select (select .cse12 (select (select (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_1428)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0))))))))))) is different from false [2024-11-19 06:53:40,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7)) (.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1423)))) (or (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1422)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12))) (or (forall ((v_ArrVal_1428 Int)) (= (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_1428)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (+ (select (select (store .cse5 .cse3 v_ArrVal_1427) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4)) 0)) (not (= (store (select .cse5 .cse3) .cse4 (select v_ArrVal_1427 .cse4)) v_ArrVal_1427)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1423)))) (or (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1422)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse14 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12))) (or (forall ((v_ArrVal_1428 Int)) (= (let ((.cse11 (store .cse15 .cse13 v_ArrVal_1427))) (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_1428)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (+ (select (select .cse11 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) 0)) (not (= (store (select .cse15 .cse13) .cse14 (select v_ArrVal_1427 .cse14)) v_ArrVal_1427)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33|))))))) is different from false [2024-11-19 06:53:40,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1423)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1422)))) (let ((.cse3 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1427 (store (select .cse0 .cse2) .cse3 (select v_ArrVal_1427 .cse3)))) (forall ((v_ArrVal_1428 Int)) (= (let ((.cse4 (store .cse0 .cse2 v_ArrVal_1427))) (select (select .cse4 (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_1428)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)))) 0))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_33| Int)) (or (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_33|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_30| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1423)))) (or (forall ((v_ArrVal_1427 (Array Int Int))) (let ((.cse15 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_33| v_ArrVal_1422)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_30| 12)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (not (= v_ArrVal_1427 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1427 .cse13)))) (forall ((v_ArrVal_1428 Int)) (= (select (let ((.cse14 (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_ArrVal_1428)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ 4 (select (select (store .cse11 .cse12 v_ArrVal_1427) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_30| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))))))) is different from false [2024-11-19 06:53:42,643 INFO L349 Elim1Store]: treesize reduction 405, result has 30.9 percent of original size [2024-11-19 06:53:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 913123 treesize of output 600441 [2024-11-19 06:53:48,120 INFO L349 Elim1Store]: treesize reduction 1607, result has 25.6 percent of original size [2024-11-19 06:53:48,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 56 case distinctions, treesize of input 1053984 treesize of output 920642 [2024-11-19 06:53:51,998 INFO L349 Elim1Store]: treesize reduction 1392, result has 25.4 percent of original size [2024-11-19 06:53:51,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 92670 treesize of output 89745 [2024-11-19 06:53:54,229 INFO L349 Elim1Store]: treesize reduction 647, result has 27.6 percent of original size [2024-11-19 06:53:54,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 90301 treesize of output 66496 [2024-11-19 06:53:57,572 INFO L349 Elim1Store]: treesize reduction 94, result has 80.3 percent of original size [2024-11-19 06:53:57,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 45 case distinctions, treesize of input 97188 treesize of output 73564 [2024-11-19 06:54:01,064 INFO L349 Elim1Store]: treesize reduction 30, result has 95.7 percent of original size [2024-11-19 06:54:01,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 71903 treesize of output 70724