./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-lst-shared.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 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:55:31,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:55:31,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:55:31,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:55:31,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:55:31,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:55:31,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:55:31,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:55:31,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:55:31,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:55:31,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:55:31,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:55:31,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:55:31,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:55:31,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:55:31,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:55:31,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:55:31,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:55:31,724 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:55:31,724 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:55:31,724 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:55:31,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:55:31,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:55:31,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:55:31,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:55:31,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:55:31,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:55:31,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:55:31,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:55:31,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:55:31,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:31,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:55:31,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:55:31,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:55:31,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:55:31,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:55:31,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:55:31,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:55:31,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:55:31,730 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 -> 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 [2024-11-09 07:55:31,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:55:31,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:55:32,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:55:32,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:55:32,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:55:32,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i [2024-11-09 07:55:33,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:55:33,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:55:33,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-lst-shared.i [2024-11-09 07:55:33,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8768cabc/66516b128413454fbfa9085224d8160d/FLAGb565bcd1f [2024-11-09 07:55:34,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8768cabc/66516b128413454fbfa9085224d8160d [2024-11-09 07:55:34,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:55:34,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:55:34,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:34,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:55:34,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:55:34,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432409e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34, skipping insertion in model container [2024-11-09 07:55:34,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:55:34,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:34,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:55:34,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:34,511 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:55:34,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34 WrapperNode [2024-11-09 07:55:34,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:34,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:34,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:55:34,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:55:34,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,559 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2024-11-09 07:55:34,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:34,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:55:34,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:55:34,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:55:34,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,588 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 5 writes are split as follows [5]. [2024-11-09 07:55:34,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:55:34,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:55:34,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:55:34,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:55:34,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (1/1) ... [2024-11-09 07:55:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:34,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:34,642 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-09 07:55:34,644 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-09 07:55:34,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:55:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:55:34,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:55:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:55:34,778 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:55:34,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:55:35,048 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-09 07:55:35,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:55:35,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:55:35,065 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:55:35,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:35 BoogieIcfgContainer [2024-11-09 07:55:35,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:55:35,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:55:35,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:55:35,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:55:35,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:55:34" (1/3) ... [2024-11-09 07:55:35,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d6f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:35, skipping insertion in model container [2024-11-09 07:55:35,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:34" (2/3) ... [2024-11-09 07:55:35,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273d6f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:35, skipping insertion in model container [2024-11-09 07:55:35,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:35" (3/3) ... [2024-11-09 07:55:35,075 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-lst-shared.i [2024-11-09 07:55:35,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:55:35,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-09 07:55:35,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:55:35,191 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;@3966a6a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:55:35,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-09 07:55:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 71 states have internal predecessors, (78), 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-09 07:55:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:35,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:35,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:35,207 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 26 more)] === [2024-11-09 07:55:35,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 34518161, now seen corresponding path program 1 times [2024-11-09 07:55:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:35,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56867575] [2024-11-09 07:55:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:35,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56867575] [2024-11-09 07:55:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56867575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179965516] [2024-11-09 07:55:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:35,495 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 71 states have internal predecessors, (78), 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-09 07:55:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:35,586 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-09 07:55:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:35,588 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-09 07:55:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:35,595 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:55:35,596 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:55:35,597 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-09 07:55:35,602 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:35,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:55:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 07:55:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 68 states have internal predecessors, (72), 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-09 07:55:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 07:55:35,647 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 5 [2024-11-09 07:55:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:35,647 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 07:55:35,648 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-09 07:55:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 07:55:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:35,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:35,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:35,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:55:35,649 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 26 more)] === [2024-11-09 07:55:35,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 34518162, now seen corresponding path program 1 times [2024-11-09 07:55:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299459176] [2024-11-09 07:55:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:35,797 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-09 07:55:35,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:35,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299459176] [2024-11-09 07:55:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299459176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168811374] [2024-11-09 07:55:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:35,804 INFO L87 Difference]: Start difference. First operand 72 states and 76 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-09 07:55:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:35,863 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-09 07:55:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:35,863 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-09 07:55:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:35,864 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:55:35,864 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:55:35,865 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-09 07:55:35,866 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:35,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:55:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 07:55:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 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-09 07:55:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-09 07:55:35,877 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 5 [2024-11-09 07:55:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:35,877 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-09 07:55:35,878 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-09 07:55:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-09 07:55:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:55:35,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:35,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:35,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:55:35,879 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 26 more)] === [2024-11-09 07:55:35,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash 888666692, now seen corresponding path program 1 times [2024-11-09 07:55:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011563072] [2024-11-09 07:55:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:35,996 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-09 07:55:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011563072] [2024-11-09 07:55:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011563072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534737067] [2024-11-09 07:55:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:36,003 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:36,109 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-09 07:55:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:36,112 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:55:36,114 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:55:36,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:36,116 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:36,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:55:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2024-11-09 07:55:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 66 states have internal predecessors, (70), 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-09 07:55:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-09 07:55:36,131 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 10 [2024-11-09 07:55:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:36,132 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-09 07:55:36,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-09 07:55:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:55:36,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:36,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:36,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:55:36,136 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 26 more)] === [2024-11-09 07:55:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 888666693, now seen corresponding path program 1 times [2024-11-09 07:55:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421055457] [2024-11-09 07:55:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:36,271 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-09 07:55:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:36,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421055457] [2024-11-09 07:55:36,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421055457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:36,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195809192] [2024-11-09 07:55:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:36,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:36,275 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:36,355 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-09 07:55:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:36,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:36,357 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:55:36,357 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:55:36,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:36,358 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:36,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:55:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-09 07:55:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 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-09 07:55:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-09 07:55:36,366 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 10 [2024-11-09 07:55:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:36,366 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-09 07:55:36,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-09 07:55:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-09 07:55:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:36,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:36,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:36,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:55:36,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -689801403, now seen corresponding path program 1 times [2024-11-09 07:55:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785607120] [2024-11-09 07:55:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:36,576 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-09 07:55:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785607120] [2024-11-09 07:55:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785607120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:36,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578447878] [2024-11-09 07:55:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:36,578 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:36,737 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-11-09 07:55:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:36,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:36,740 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:55:36,740 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:55:36,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:36,742 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:36,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 226 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:55:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-11-09 07:55:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-11-09 07:55:36,751 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2024-11-09 07:55:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:36,751 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-11-09 07:55:36,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-11-09 07:55:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:36,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:36,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:55:36,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash -689801402, now seen corresponding path program 1 times [2024-11-09 07:55:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406760056] [2024-11-09 07:55:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,044 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-09 07:55:37,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:37,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406760056] [2024-11-09 07:55:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406760056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:37,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566425361] [2024-11-09 07:55:37,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:37,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:37,049 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:37,186 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-09 07:55:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:37,188 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:55:37,188 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:55:37,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:37,190 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:37,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:55:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2024-11-09 07:55:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-09 07:55:37,194 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2024-11-09 07:55:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-09 07:55:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-09 07:55:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-09 07:55:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:55:37,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:37,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:55:37,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:37,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -552207829, now seen corresponding path program 1 times [2024-11-09 07:55:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979541633] [2024-11-09 07:55:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,297 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-09 07:55:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979541633] [2024-11-09 07:55:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979541633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:37,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:37,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:55:37,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898900531] [2024-11-09 07:55:37,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:37,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:55:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:37,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:55:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:55:37,300 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-09 07:55:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:37,436 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-09 07:55:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2024-11-09 07:55:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:37,438 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:55:37,438 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:55:37,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09 07:55:37,439 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:37,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:55:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-09 07:55:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 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-09 07:55:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-09 07:55:37,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 18 [2024-11-09 07:55:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:37,446 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-09 07:55:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-09 07:55:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-09 07:55:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:55:37,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:37,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:55:37,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -552207828, now seen corresponding path program 1 times [2024-11-09 07:55:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068734086] [2024-11-09 07:55:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,700 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-09 07:55:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068734086] [2024-11-09 07:55:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068734086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028725785] [2024-11-09 07:55:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:37,703 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-09 07:55:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:37,884 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2024-11-09 07:55:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:55:37,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 18 [2024-11-09 07:55:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:37,885 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:55:37,885 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:55:37,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:37,886 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:37,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:55:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-09 07:55:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 75 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-09 07:55:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-09 07:55:37,892 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 18 [2024-11-09 07:55:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:37,892 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-09 07:55:37,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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-09 07:55:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-09 07:55:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:55:37,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:37,893 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-09 07:55:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:55:37,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1904175387, now seen corresponding path program 1 times [2024-11-09 07:55:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801353062] [2024-11-09 07:55:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,010 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-09 07:55:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801353062] [2024-11-09 07:55:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801353062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858340524] [2024-11-09 07:55:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:38,012 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.0) 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-09 07:55:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,104 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2024-11-09 07:55:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) 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-09 07:55:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,105 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:55:38,106 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:55:38,106 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-09 07:55:38,106 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 405 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:55:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-09 07:55:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.543859649122807) internal successors, (88), 76 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-09 07:55:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-11-09 07:55:38,111 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 20 [2024-11-09 07:55:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-09 07:55:38,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) 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-09 07:55:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-11-09 07:55:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:38,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:55:38,113 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 26 more)] === [2024-11-09 07:55:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2038013526, now seen corresponding path program 1 times [2024-11-09 07:55:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060153904] [2024-11-09 07:55:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,272 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-09 07:55:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060153904] [2024-11-09 07:55:38,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060153904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:55:38,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268608812] [2024-11-09 07:55:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:55:38,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:55:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:55:38,275 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,398 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-09 07:55:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:55:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-09 07:55:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,400 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:55:38,400 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:55:38,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:55:38,401 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 186 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:55:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-09 07:55:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 76 states have internal predecessors, (87), 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-09 07:55:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-09 07:55:38,408 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2024-11-09 07:55:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,408 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-09 07:55:38,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-09 07:55:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:38,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:55:38,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:38,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2038013527, now seen corresponding path program 1 times [2024-11-09 07:55:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074516447] [2024-11-09 07:55:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074516447] [2024-11-09 07:55:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074516447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887761657] [2024-11-09 07:55:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:38,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:38,877 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-09 07:55:38,879 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-09 07:55:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:55:38,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:39,063 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-09 07:55:39,078 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-09 07:55:39,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:39,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:55:39,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:39,215 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-09 07:55:39,326 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-09 07:55:39,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:39,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:55:39,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:39,369 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-09 07:55:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:55:39,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887761657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:39,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-09 07:55:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746291916] [2024-11-09 07:55:39,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:39,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:55:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:55:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-09 07:55:39,509 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:55:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:39,815 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 07:55:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-11-09 07:55:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:39,817 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:55:39,817 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:55:39,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-11-09 07:55:39,818 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 38 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:39,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 370 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2024-11-09 07:55:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:55:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-09 07:55:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 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-09 07:55:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-09 07:55:39,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 21 [2024-11-09 07:55:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:39,822 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-09 07:55:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:55:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-09 07:55:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:39,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:39,823 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-09 07:55:39,842 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-09 07:55:40,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:55:40,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1098658217, now seen corresponding path program 1 times [2024-11-09 07:55:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578299564] [2024-11-09 07:55:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,332 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-09 07:55:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578299564] [2024-11-09 07:55:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578299564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076137801] [2024-11-09 07:55:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:55:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:55:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:40,335 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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-09 07:55:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:40,500 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-09 07:55:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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-09 07:55:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:40,501 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:55:40,501 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:55:40,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:40,502 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:40,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 292 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:55:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:55:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.421875) internal successors, (91), 83 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-09 07:55:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-09 07:55:40,506 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 21 [2024-11-09 07:55:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:40,506 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-09 07:55:40,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 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-09 07:55:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-09 07:55:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:40,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:40,507 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] [2024-11-09 07:55:40,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:55:40,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:40,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash 803258831, now seen corresponding path program 1 times [2024-11-09 07:55:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871249548] [2024-11-09 07:55:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,644 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-09 07:55:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871249548] [2024-11-09 07:55:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871249548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119431015] [2024-11-09 07:55:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:40,646 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-09 07:55:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:40,775 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-11-09 07:55:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 24 [2024-11-09 07:55:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:40,776 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:55:40,776 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:55:40,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:40,777 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:40,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 267 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:55:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:55:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.390625) internal successors, (89), 82 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-09 07:55:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-09 07:55:40,780 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 24 [2024-11-09 07:55:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-09 07:55:40,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-09 07:55:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-09 07:55:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:40,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:40,781 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] [2024-11-09 07:55:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:55:40,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:40,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 803258832, now seen corresponding path program 1 times [2024-11-09 07:55:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986117974] [2024-11-09 07:55:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,017 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-09 07:55:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986117974] [2024-11-09 07:55:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986117974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268635102] [2024-11-09 07:55:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:41,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:41,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:41,020 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-09 07:55:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:41,149 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 07:55:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2024-11-09 07:55:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:41,151 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:55:41,151 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:55:41,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:41,152 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:41,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 290 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:55:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:55:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.359375) internal successors, (87), 81 states have internal predecessors, (87), 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-09 07:55:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-09 07:55:41,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 24 [2024-11-09 07:55:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:41,155 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-09 07:55:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-09 07:55:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-09 07:55:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:41,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:41,156 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:41,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:55:41,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1818827793, now seen corresponding path program 1 times [2024-11-09 07:55:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857575661] [2024-11-09 07:55:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857575661] [2024-11-09 07:55:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857575661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977453214] [2024-11-09 07:55:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:41,650 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-09 07:55:41,651 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-09 07:55:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 07:55:41,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:41,758 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-09 07:55:41,779 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-09 07:55:41,785 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-09 07:55:41,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:41,891 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-09 07:55:41,935 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 18 treesize of output 13 [2024-11-09 07:55:41,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:55:41,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:41,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:55:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:41,986 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-09 07:55:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:42,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:44,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:44,611 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 22 treesize of output 23 [2024-11-09 07:55:44,615 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 36 treesize of output 24 [2024-11-09 07:55:44,623 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:55:44,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 07:55:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977453214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:44,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 31 [2024-11-09 07:55:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487880822] [2024-11-09 07:55:44,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:44,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:55:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:44,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:55:44,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=820, Unknown=20, NotChecked=0, Total=930 [2024-11-09 07:55:44,654 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:48,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:55:52,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:55:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,198 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-09 07:55:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-09 07:55:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,199 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:55:53,199 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:55:53,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=126, Invalid=1114, Unknown=20, NotChecked=0, Total=1260 [2024-11-09 07:55:53,200 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 829 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-09 07:55:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:55:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:55:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 83 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-09 07:55:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-09 07:55:53,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 24 [2024-11-09 07:55:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,204 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-09 07:55:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-09 07:55:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:55:53,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,205 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-09 07:55:53,224 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-09 07:55:53,405 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,SelfDestructingSolverStorable14 [2024-11-09 07:55:53,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:53,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash -158226047, now seen corresponding path program 1 times [2024-11-09 07:55:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542422068] [2024-11-09 07:55:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,506 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-09 07:55:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542422068] [2024-11-09 07:55:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542422068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335694927] [2024-11-09 07:55:53,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:53,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:53,508 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,673 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-09 07:55:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:53,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 07:55:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,674 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:55:53,675 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:55:53,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:53,675 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 206 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:55:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-09 07:55:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 93 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 07:55:53,679 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 26 [2024-11-09 07:55:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,679 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 07:55:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 07:55:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:55:53,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,680 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-09 07:55:53,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:55:53,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:53,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash -158226046, now seen corresponding path program 1 times [2024-11-09 07:55:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896605139] [2024-11-09 07:55:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896605139] [2024-11-09 07:55:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896605139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235149944] [2024-11-09 07:55:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:53,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:53,871 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-09 07:55:53,872 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-09 07:55:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:55:53,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:54,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:54,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:54,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 07:55:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235149944] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:54,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:54,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 20 [2024-11-09 07:55:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424981487] [2024-11-09 07:55:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:54,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:55:54,312 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) 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-09 07:55:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,500 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2024-11-09 07:55:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) 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-09 07:55:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,502 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:55:54,502 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:55:54,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:55:54,503 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:54,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 227 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:55:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-09 07:55:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 93 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-09 07:55:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-09 07:55:54,509 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 26 [2024-11-09 07:55:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,509 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-09 07:55:54,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) 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-09 07:55:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-09 07:55:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:55:54,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,511 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] [2024-11-09 07:55:54,529 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-09 07:55:54,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:54,715 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -610028934, now seen corresponding path program 1 times [2024-11-09 07:55:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012345982] [2024-11-09 07:55:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,844 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-09 07:55:54,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012345982] [2024-11-09 07:55:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012345982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778541128] [2024-11-09 07:55:54,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:54,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:54,847 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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-09 07:55:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,958 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-09 07:55:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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 27 [2024-11-09 07:55:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,959 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:55:54,959 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:55:54,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:54,960 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:54,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 350 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:55:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2024-11-09 07:55:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-09 07:55:54,963 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 27 [2024-11-09 07:55:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,964 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-09 07:55:54,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 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-09 07:55:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-09 07:55:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:55:54,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,967 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] [2024-11-09 07:55:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:55:54,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -610040113, now seen corresponding path program 1 times [2024-11-09 07:55:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160933300] [2024-11-09 07:55:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,116 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-09 07:55:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160933300] [2024-11-09 07:55:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160933300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:55,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:55:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411482241] [2024-11-09 07:55:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:55,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:55,119 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-09 07:55:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:55,277 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-09 07:55:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 27 [2024-11-09 07:55:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:55,279 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:55:55,279 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:55:55,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:55,280 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:55,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 296 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:55:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-11-09 07:55:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3125) internal successors, (105), 96 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-09 07:55:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-09 07:55:55,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 27 [2024-11-09 07:55:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:55,283 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-09 07:55:55,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-09 07:55:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-09 07:55:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:55:55,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:55,284 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-09 07:55:55,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:55:55,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:55,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1731374207, now seen corresponding path program 1 times [2024-11-09 07:55:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:55,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704243935] [2024-11-09 07:55:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,453 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-09 07:55:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704243935] [2024-11-09 07:55:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704243935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:55,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:55:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691642161] [2024-11-09 07:55:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:55,455 INFO L87 Difference]: Start difference. First operand 101 states and 111 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-09 07:55:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:55,669 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-09 07:55:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:55,670 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-09 07:55:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:55,670 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:55:55,670 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:55:55,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:55,671 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:55,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:55:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-09 07:55:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.308641975308642) internal successors, (106), 97 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-09 07:55:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-09 07:55:55,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2024-11-09 07:55:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-09 07:55:55,676 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-09 07:55:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-09 07:55:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:55:55,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:55,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:55,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:55:55,678 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2132992751, now seen corresponding path program 1 times [2024-11-09 07:55:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:55,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849114298] [2024-11-09 07:55:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,845 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-09 07:55:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849114298] [2024-11-09 07:55:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849114298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790768272] [2024-11-09 07:55:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:55,848 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-09 07:55:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:56,039 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-09 07:55:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 29 [2024-11-09 07:55:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:56,040 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:55:56,040 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:55:56,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:55:56,041 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:56,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:55:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 07:55:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-09 07:55:56,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 29 [2024-11-09 07:55:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-09 07:55:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-09 07:55:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-09 07:55:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:55:56,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:56,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:56,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:55:56,046 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:56,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1106629516, now seen corresponding path program 1 times [2024-11-09 07:55:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:56,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013085837] [2024-11-09 07:55:56,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,329 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-09 07:55:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013085837] [2024-11-09 07:55:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013085837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:56,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:56,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:55:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84387339] [2024-11-09 07:55:56,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:56,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:55:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:55:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:56,331 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-09 07:55:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:56,595 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2024-11-09 07:55:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 31 [2024-11-09 07:55:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:56,598 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:55:56,598 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:55:56,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:55:56,599 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:56,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 266 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:55:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-09 07:55:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 100 states have internal predecessors, (110), 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-09 07:55:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-11-09 07:55:56,604 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 31 [2024-11-09 07:55:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-11-09 07:55:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-09 07:55:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-11-09 07:55:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:55:56,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:56,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:56,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:55:56,605 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1106629515, now seen corresponding path program 1 times [2024-11-09 07:55:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589546255] [2024-11-09 07:55:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:56,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:56,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589546255] [2024-11-09 07:55:56,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589546255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495642405] [2024-11-09 07:55:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:56,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:56,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:56,815 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-09 07:55:56,816 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-09 07:55:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:55:56,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:57,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:57,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:57,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 07:55:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495642405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:57,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-11-09 07:55:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2728623] [2024-11-09 07:55:57,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:55:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:55:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:55:57,235 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:57,495 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-09 07:55:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:55:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 07:55:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:57,497 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:55:57,497 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:55:57,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:55:57,498 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:57,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 505 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:55:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2024-11-09 07:55:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 07:55:57,504 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 31 [2024-11-09 07:55:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:57,504 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 07:55:57,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 07:55:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:55:57,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:57,505 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, 1, 1] [2024-11-09 07:55:57,524 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-09 07:55:57,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:57,706 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 569121521, now seen corresponding path program 1 times [2024-11-09 07:55:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256585198] [2024-11-09 07:55:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,855 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-09 07:55:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:57,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256585198] [2024-11-09 07:55:57,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256585198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:57,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467229864] [2024-11-09 07:55:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:57,857 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-09 07:55:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:58,004 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-09 07:55:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 34 [2024-11-09 07:55:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:58,005 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:55:58,005 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:55:58,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:58,007 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:58,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 322 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:55:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 07:55:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 103 states have internal predecessors, (113), 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-09 07:55:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-09 07:55:58,011 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 34 [2024-11-09 07:55:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:58,011 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-09 07:55:58,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-09 07:55:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-09 07:55:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:55:58,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:58,012 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] [2024-11-09 07:55:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:55:58,012 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 26 more)] === [2024-11-09 07:55:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 945604030, now seen corresponding path program 1 times [2024-11-09 07:55:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837309837] [2024-11-09 07:55:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:55:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:55:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837309837] [2024-11-09 07:55:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837309837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585038420] [2024-11-09 07:55:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:58,445 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-09 07:55:58,446 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-09 07:55:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:55:58,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:58,637 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:58,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:55:58,656 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-09 07:55:58,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:55:58,716 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-09 07:55:58,733 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-09 07:55:58,748 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-09 07:55:58,762 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:55:58,762 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-09 07:55:58,769 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-09 07:55:58,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:58,877 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 07:55:58,877 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-09 07:55:58,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_948) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) is different from false [2024-11-09 07:55:58,971 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-09 07:55:58,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585038420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:58,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 23 [2024-11-09 07:55:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72732186] [2024-11-09 07:55:58,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:58,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:55:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:58,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:55:58,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=402, Unknown=2, NotChecked=82, Total=552 [2024-11-09 07:55:58,973 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 07:55:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:59,277 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-11-09 07:55:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:59,278 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 36 [2024-11-09 07:55:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:59,278 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:55:59,279 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:55:59,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=604, Unknown=2, NotChecked=102, Total=812 [2024-11-09 07:55:59,280 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:59,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2024-11-09 07:55:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:55:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-09 07:55:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 07:55:59,283 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 36 [2024-11-09 07:55:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:59,283 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 07:55:59,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 07:55:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 07:55:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:55:59,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:59,284 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] [2024-11-09 07:55:59,361 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-09 07:55:59,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:55:59,513 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:55:59,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash 945604031, now seen corresponding path program 1 times [2024-11-09 07:55:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515700082] [2024-11-09 07:55:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:56:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:56:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:00,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515700082] [2024-11-09 07:56:00,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515700082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:00,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935370021] [2024-11-09 07:56:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:00,170 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-09 07:56:00,172 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-09 07:56:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:56:00,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:00,350 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-09 07:56:00,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:00,419 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-09 07:56:00,455 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-09 07:56:00,460 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-09 07:56:00,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:00,545 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 73 treesize of output 66 [2024-11-09 07:56:00,553 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-09 07:56:00,576 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 42 treesize of output 18 [2024-11-09 07:56:00,581 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-09 07:56:00,627 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-09 07:56:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:00,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:56:00,660 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:00,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 11 treesize of output 11 [2024-11-09 07:56:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:56:00,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935370021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:00,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2024-11-09 07:56:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488501479] [2024-11-09 07:56:00,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:56:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:56:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=534, Unknown=1, NotChecked=46, Total=650 [2024-11-09 07:56:00,785 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:56:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:01,237 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-11-09 07:56:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:56:01,238 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-09 07:56:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:01,239 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:56:01,239 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:56:01,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=867, Unknown=1, NotChecked=60, Total=1056 [2024-11-09 07:56:01,241 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:01,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 599 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 411 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2024-11-09 07:56:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:56:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:56:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-11-09 07:56:01,246 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 36 [2024-11-09 07:56:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:01,246 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-11-09 07:56:01,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 18 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:56:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-11-09 07:56:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:56:01,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:01,249 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] [2024-11-09 07:56:01,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:56:01,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:56:01,454 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:01,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2103899583, now seen corresponding path program 1 times [2024-11-09 07:56:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488202661] [2024-11-09 07:56:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,696 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-09 07:56:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488202661] [2024-11-09 07:56:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488202661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41389510] [2024-11-09 07:56:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:01,699 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-09 07:56:01,701 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-09 07:56:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:56:01,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:01,939 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-09 07:56:01,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:02,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:02,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 07:56:02,114 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-09 07:56:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41389510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:02,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-09 07:56:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016317291] [2024-11-09 07:56:02,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:02,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:56:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:56:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:56:02,116 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:02,274 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-09 07:56:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2024-11-09 07:56:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:02,276 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:56:02,276 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:56:02,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:56:02,276 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:02,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 596 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:56:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-09 07:56:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 07:56:02,283 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 36 [2024-11-09 07:56:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:02,283 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 07:56:02,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 07:56:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:56:02,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:02,285 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, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:02,300 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-09 07:56:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:02,486 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:02,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1831518759, now seen corresponding path program 1 times [2024-11-09 07:56:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880252474] [2024-11-09 07:56:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,977 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-09 07:56:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880252474] [2024-11-09 07:56:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880252474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469454461] [2024-11-09 07:56:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:02,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:02,980 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-09 07:56:02,981 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-09 07:56:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 07:56:03,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:03,108 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-09 07:56:03,110 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-09 07:56:03,221 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:03,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:56:03,241 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:03,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:56:03,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 07:56:03,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 07:56:03,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-09 07:56:03,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:03,676 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 25 treesize of output 23 [2024-11-09 07:56:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:03,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:03,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2024-11-09 07:56:03,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:03,713 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-09 07:56:03,835 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-09 07:56:03,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:03,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:56:04,231 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 0) |c_ULTIMATE.start_create_~sll~0#1.base|)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|))) (or (= (select .cse2 8) 0) (= (select .cse2 0) |c_ULTIMATE.start_create_~sll~0#1.base|))))) is different from false [2024-11-09 07:56:04,251 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select .cse0 0))))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)) (forall ((v_ArrVal_1245 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|) 0)))))) is different from false [2024-11-09 07:56:04,304 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|) 0) |c_alloc_and_zero_#res.base|)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) |c_alloc_and_zero_#res.base|))))) is different from false [2024-11-09 07:56:04,339 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1245 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.base|) 0) c_alloc_and_zero_~pi~0.base)) (forall ((v_ArrVal_1244 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1244) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1245 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1245) c_alloc_and_zero_~pi~0.base) c_alloc_and_zero_~pi~0.offset |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) c_alloc_and_zero_~pi~0.base))))) is different from false [2024-11-09 07:56:04,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:04,353 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 23 treesize of output 24 [2024-11-09 07:56:04,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 07:56:04,381 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:56:04,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-09 07:56:04,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:56:04,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:04,396 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 23 treesize of output 24 [2024-11-09 07:56:04,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 07:56:04,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:04,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:04,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-09 07:56:04,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 07:56:04,442 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-09 07:56:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469454461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:04,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 39 [2024-11-09 07:56:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252505481] [2024-11-09 07:56:04,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 07:56:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 07:56:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1104, Unknown=4, NotChecked=276, Total=1482 [2024-11-09 07:56:04,444 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:56:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:05,460 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-11-09 07:56:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:56:05,461 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 07:56:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:05,462 INFO L225 Difference]: With dead ends: 142 [2024-11-09 07:56:05,463 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 07:56:05,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=1996, Unknown=4, NotChecked=372, Total=2550 [2024-11-09 07:56:05,464 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:05,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 685 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1038 Invalid, 0 Unknown, 301 Unchecked, 0.6s Time] [2024-11-09 07:56:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 07:56:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2024-11-09 07:56:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 126 states have internal predecessors, (146), 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-09 07:56:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-11-09 07:56:05,470 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 37 [2024-11-09 07:56:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:05,470 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-11-09 07:56:05,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:56:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-11-09 07:56:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:56:05,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:05,471 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, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:05,489 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-09 07:56:05,672 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,SelfDestructingSolverStorable27 [2024-11-09 07:56:05,673 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:05,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -942508120, now seen corresponding path program 1 times [2024-11-09 07:56:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:05,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109044221] [2024-11-09 07:56:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:05,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,154 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-09 07:56:06,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:06,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109044221] [2024-11-09 07:56:06,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109044221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:06,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544099225] [2024-11-09 07:56:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:06,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:06,157 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-09 07:56:06,159 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-09 07:56:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:56:06,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:06,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:56:06,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:06,750 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 39 treesize of output 31 [2024-11-09 07:56:07,148 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_23| Int) (|v_ULTIMATE.start_destroy_#t~mem13#1.base_14| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_23| 1) |v_ULTIMATE.start_destroy_#t~mem13#1.base_14|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_23|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem13#1.base_14| 0) |v_ULTIMATE.start_destroy_~l#1.base_23| 0)))) is different from true [2024-11-09 07:56:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 07:56:07,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:07,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-09 07:56:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544099225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:07,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2024-11-09 07:56:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003378567] [2024-11-09 07:56:07,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:56:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:56:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1310, Unknown=1, NotChecked=72, Total=1482 [2024-11-09 07:56:07,854 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:08,741 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-09 07:56:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 07:56:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:08,742 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:56:08,742 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 07:56:08,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=160, Invalid=2005, Unknown=1, NotChecked=90, Total=2256 [2024-11-09 07:56:08,743 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:08,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 764 Invalid, 0 Unknown, 84 Unchecked, 0.5s Time] [2024-11-09 07:56:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 07:56:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 07:56:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 109 states have internal predecessors, (128), 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-09 07:56:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2024-11-09 07:56:08,747 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 38 [2024-11-09 07:56:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2024-11-09 07:56:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2024-11-09 07:56:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:56:08,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:08,748 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:08,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:56:08,948 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,SelfDestructingSolverStorable28 [2024-11-09 07:56:08,949 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 814734249, now seen corresponding path program 1 times [2024-11-09 07:56:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977579153] [2024-11-09 07:56:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977579153] [2024-11-09 07:56:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977579153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190696985] [2024-11-09 07:56:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:09,575 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-09 07:56:09,576 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-09 07:56:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:56:09,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:09,825 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-09 07:56:10,006 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:10,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:56:10,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 5 treesize of output 3 [2024-11-09 07:56:10,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:10,022 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-09 07:56:10,063 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-09 07:56:10,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:10,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:56:10,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:56:10,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:10,203 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-09 07:56:10,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 36 [2024-11-09 07:56:10,493 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:56:10,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 19 [2024-11-09 07:56:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:10,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:10,688 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2024-11-09 07:56:10,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 26 treesize of output 25 [2024-11-09 07:56:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190696985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:10,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2024-11-09 07:56:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299013499] [2024-11-09 07:56:10,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:10,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:56:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:56:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 07:56:10,924 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:11,722 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2024-11-09 07:56:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-09 07:56:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:11,724 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:56:11,724 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:56:11,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=264, Invalid=2816, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 07:56:11,725 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:11,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 899 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:56:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:56:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 07:56:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 110 states have internal predecessors, (130), 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-09 07:56:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2024-11-09 07:56:11,733 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 39 [2024-11-09 07:56:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:11,733 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2024-11-09 07:56:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 31 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2024-11-09 07:56:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:56:11,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:11,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:11,753 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-09 07:56:11,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:11,935 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 814734250, now seen corresponding path program 1 times [2024-11-09 07:56:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:11,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016534764] [2024-11-09 07:56:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:11,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016534764] [2024-11-09 07:56:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016534764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005600781] [2024-11-09 07:56:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:12,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:12,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:12,947 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-09 07:56:12,949 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-09 07:56:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:13,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-09 07:56:13,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:13,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:13,322 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-09 07:56:13,363 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-09 07:56:13,365 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-09 07:56:13,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:13,465 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 88 treesize of output 48 [2024-11-09 07:56:13,469 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 43 treesize of output 13 [2024-11-09 07:56:13,664 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-09 07:56:13,668 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-09 07:56:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:13,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:13,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,922 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 61 treesize of output 65 [2024-11-09 07:56:14,149 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 81 treesize of output 75 [2024-11-09 07:56:14,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:14,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:14,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:14,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005600781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:14,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2024-11-09 07:56:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005866589] [2024-11-09 07:56:14,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:56:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:14,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:56:14,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 07:56:14,306 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:14,890 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2024-11-09 07:56:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:56:14,891 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-09 07:56:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:14,891 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:56:14,892 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:56:14,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 07:56:14,893 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 31 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:14,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 865 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:56:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:56:14,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 07:56:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 113 states have internal predecessors, (132), 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-09 07:56:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2024-11-09 07:56:14,896 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 39 [2024-11-09 07:56:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:14,896 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2024-11-09 07:56:14,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 31 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2024-11-09 07:56:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:14,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:14,897 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] [2024-11-09 07:56:14,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:15,098 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,SelfDestructingSolverStorable30 [2024-11-09 07:56:15,098 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:15,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 886407223, now seen corresponding path program 1 times [2024-11-09 07:56:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554829038] [2024-11-09 07:56:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:56:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554829038] [2024-11-09 07:56:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554829038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449917697] [2024-11-09 07:56:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:15,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:15,587 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-09 07:56:15,589 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-09 07:56:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:56:15,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:15,796 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-09 07:56:15,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:15,881 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-09 07:56:15,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:15,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:56:15,908 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-09 07:56:15,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-09 07:56:15,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:15,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:16,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1637) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) 0)) is different from false [2024-11-09 07:56:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449917697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:16,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2024-11-09 07:56:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681669533] [2024-11-09 07:56:16,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:16,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:56:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:16,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:56:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=388, Unknown=18, NotChecked=40, Total=506 [2024-11-09 07:56:16,110 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:16,389 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2024-11-09 07:56:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:56:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-09 07:56:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:16,391 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:56:16,391 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:56:16,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=588, Unknown=18, NotChecked=50, Total=756 [2024-11-09 07:56:16,391 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:16,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 506 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:56:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:56:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2024-11-09 07:56:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 115 states have internal predecessors, (134), 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-09 07:56:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-09 07:56:16,395 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 42 [2024-11-09 07:56:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-09 07:56:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-09 07:56:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:56:16,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:16,396 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] [2024-11-09 07:56:16,410 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-09 07:56:16,598 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,SelfDestructingSolverStorable31 [2024-11-09 07:56:16,598 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1708820249, now seen corresponding path program 1 times [2024-11-09 07:56:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319072224] [2024-11-09 07:56:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:56:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319072224] [2024-11-09 07:56:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319072224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599102055] [2024-11-09 07:56:17,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:17,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:17,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:17,089 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-09 07:56:17,090 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-09 07:56:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 07:56:17,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:17,365 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-09 07:56:17,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:56:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:17,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:17,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:17,565 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-09 07:56:17,617 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-09 07:56:17,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:17,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:56:17,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:56:17,719 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-09 07:56:17,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 07:56:18,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 17 treesize of output 9 [2024-11-09 07:56:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:18,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599102055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:18,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:18,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-11-09 07:56:18,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779976551] [2024-11-09 07:56:18,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:18,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:56:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:56:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:56:18,573 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:22,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:56:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:23,478 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-09 07:56:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-09 07:56:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:23,479 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:56:23,479 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:56:23,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=2094, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 07:56:23,480 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:23,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 633 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 672 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 07:56:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:56:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2024-11-09 07:56:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 117 states have internal predecessors, (136), 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-09 07:56:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2024-11-09 07:56:23,484 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 43 [2024-11-09 07:56:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:23,484 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2024-11-09 07:56:23,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 28 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2024-11-09 07:56:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:56:23,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:23,485 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] [2024-11-09 07:56:23,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:23,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 07:56:23,690 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:23,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1433820281, now seen corresponding path program 1 times [2024-11-09 07:56:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403989392] [2024-11-09 07:56:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:24,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:56:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403989392] [2024-11-09 07:56:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403989392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921278481] [2024-11-09 07:56:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:24,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:24,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:56:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:24,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:56:24,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:24,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:24,617 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-09 07:56:24,659 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-09 07:56:24,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:24,725 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-09 07:56:24,827 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-09 07:56:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:24,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:25,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1854 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1854) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0))) is different from false [2024-11-09 07:56:25,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1854 (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|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1854) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0))) is different from false [2024-11-09 07:56:25,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:25,015 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 23 treesize of output 24 [2024-11-09 07:56:25,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:25,022 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 39 treesize of output 38 [2024-11-09 07:56:25,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 07:56:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921278481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:25,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-11-09 07:56:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863074163] [2024-11-09 07:56:25,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:56:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:56:25,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1161, Unknown=2, NotChecked=138, Total=1406 [2024-11-09 07:56:25,129 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:25,789 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2024-11-09 07:56:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-11-09 07:56:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:25,791 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:56:25,791 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:56:25,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=2072, Unknown=2, NotChecked=186, Total=2450 [2024-11-09 07:56:25,792 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:25,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 749 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:56:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:56:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-11-09 07:56:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 113 states have internal predecessors, (131), 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-09 07:56:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-09 07:56:25,803 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 44 [2024-11-09 07:56:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-09 07:56:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.5) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-09 07:56:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:56:25,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:25,803 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2024-11-09 07:56:25,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:26,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:26,004 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 07:56:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1653040911, now seen corresponding path program 2 times [2024-11-09 07:56:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550209020] [2024-11-09 07:56:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550209020] [2024-11-09 07:56:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550209020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637699596] [2024-11-09 07:56:27,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:56:27,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:27,019 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:27,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:56:27,213 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:56:27,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:56:27,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-09 07:56:27,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:27,289 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-09 07:56:27,294 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-09 07:56:27,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:27,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-09 07:56:27,365 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-09 07:56:27,375 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-09 07:56:27,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:27,511 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-09 07:56:27,511 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-09 07:56:27,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:27,519 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-09 07:56:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:27,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:45,118 INFO L349 Elim1Store]: treesize reduction 1473, result has 47.5 percent of original size [2024-11-09 07:56:45,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 7401 treesize of output 5277 [2024-11-09 07:56:45,717 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2024-11-09 07:56:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 5701 treesize of output 4831 [2024-11-09 07:56:45,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3954 treesize of output 4030 [2024-11-09 07:56:48,335 INFO L349 Elim1Store]: treesize reduction 1557, result has 46.0 percent of original size [2024-11-09 07:56:48,336 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 15 new quantified variables, introduced 68 case distinctions, treesize of input 16218 treesize of output 9595 [2024-11-09 07:56:49,555 INFO L349 Elim1Store]: treesize reduction 388, result has 40.9 percent of original size [2024-11-09 07:56:49,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 5838 treesize of output 5480 [2024-11-09 07:56:50,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:50,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5318 treesize of output 5334