./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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-nested-sll-twice.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 f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:33:24,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:33:24,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:33:24,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:33:24,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:33:24,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:33:24,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:33:24,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:33:24,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:33:24,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:33:24,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:33:24,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:33:24,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:33:24,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:33:24,507 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:33:24,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:33:24,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:33:24,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:33:24,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:33:24,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:33:24,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:33:24,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:33:24,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:33:24,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:33:24,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:33:24,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:33:24,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:33:24,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:33:24,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:33:24,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:33:24,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:24,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:33:24,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:33:24,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:33:24,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:33:24,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:33:24,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:33:24,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:33:24,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:33:24,514 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 -> f6ffaa15235a1424658c74c69505398b6d7973f6f82933a9f22a2b097e3c0057 [2024-11-12 13:33:24,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:33:24,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:33:24,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:33:24,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:33:24,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:33:24,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-12 13:33:26,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:33:26,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:33:26,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-twice.i [2024-11-12 13:33:26,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00e3ae16/2d9ff169c0264daea0350fdb66b11beb/FLAGd1b3eb0c8 [2024-11-12 13:33:26,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00e3ae16/2d9ff169c0264daea0350fdb66b11beb [2024-11-12 13:33:26,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:33:26,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:33:26,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:26,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:33:26,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:33:26,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:26" (1/1) ... [2024-11-12 13:33:26,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f29c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:26, skipping insertion in model container [2024-11-12 13:33:26,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:26" (1/1) ... [2024-11-12 13:33:26,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:33:26,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:26,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:33:27,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:27,029 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:33:27,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27 WrapperNode [2024-11-12 13:33:27,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:27,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:27,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:33:27,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:33:27,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,072 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2024-11-12 13:33:27,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:27,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:33:27,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:33:27,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:33:27,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,102 INFO L175 MemorySlicer]: Split 22 memory accesses to 1 slices as follows [22]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-12 13:33:27,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:33:27,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:33:27,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:33:27,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:33:27,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (1/1) ... [2024-11-12 13:33:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:27,151 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-12 13:33:27,162 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-12 13:33:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure loop_internal [2024-11-12 13:33:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_internal [2024-11-12 13:33:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-12 13:33:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-12 13:33:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-11-12 13:33:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-11-12 13:33:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-12 13:33:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-12 13:33:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:33:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:33:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_internal [2024-11-12 13:33:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_internal [2024-11-12 13:33:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:33:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:33:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:33:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:33:27,331 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:33:27,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:33:27,664 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-12 13:33:27,664 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:33:27,706 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:33:27,707 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 13:33:27,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:27 BoogieIcfgContainer [2024-11-12 13:33:27,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:33:27,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:33:27,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:33:27,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:33:27,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:33:26" (1/3) ... [2024-11-12 13:33:27,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1543020f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:27, skipping insertion in model container [2024-11-12 13:33:27,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:27" (2/3) ... [2024-11-12 13:33:27,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1543020f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:27, skipping insertion in model container [2024-11-12 13:33:27,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:27" (3/3) ... [2024-11-12 13:33:27,724 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-twice.i [2024-11-12 13:33:27,758 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:33:27,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2024-11-12 13:33:27,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:33:27,897 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;@3de9eab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:33:27,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-12 13:33:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:33:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:33:27,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:27,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:33:27,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:27,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 57486637, now seen corresponding path program 1 times [2024-11-12 13:33:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749410417] [2024-11-12 13:33:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749410417] [2024-11-12 13:33:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749410417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:28,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:28,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860104056] [2024-11-12 13:33:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:28,194 INFO L87 Difference]: Start difference. First operand has 143 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 125 states have internal predecessors, (137), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-12 13:33:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:28,379 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2024-11-12 13:33:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:28,381 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-12 13:33:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:28,387 INFO L225 Difference]: With dead ends: 140 [2024-11-12 13:33:28,388 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 13:33:28,389 INFO L434 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-12 13:33:28,393 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:28,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 13:33:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-12 13:33:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.726027397260274) internal successors, (126), 120 states have internal predecessors, (126), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:33:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-12 13:33:28,428 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 5 [2024-11-12 13:33:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-12 13:33:28,428 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-12 13:33:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-12 13:33:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:33:28,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:28,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:33:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:33:28,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 57486638, now seen corresponding path program 1 times [2024-11-12 13:33:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429595905] [2024-11-12 13:33:28,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,519 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-12 13:33:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:28,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429595905] [2024-11-12 13:33:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429595905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659975040] [2024-11-12 13:33:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:28,523 INFO L87 Difference]: Start difference. First operand 138 states and 150 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-12 13:33:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:28,604 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2024-11-12 13:33:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:28,604 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-12 13:33:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:28,606 INFO L225 Difference]: With dead ends: 135 [2024-11-12 13:33:28,606 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 13:33:28,609 INFO L434 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-12 13:33:28,610 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:28,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 13:33:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-12 13:33:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 117 states have internal predecessors, (123), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:33:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-12 13:33:28,627 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 5 [2024-11-12 13:33:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:28,627 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-12 13:33:28,627 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-12 13:33:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-12 13:33:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:33:28,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:28,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:33:28,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966071, now seen corresponding path program 1 times [2024-11-12 13:33:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432099387] [2024-11-12 13:33:28,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,762 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-12 13:33:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432099387] [2024-11-12 13:33:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432099387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:28,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:28,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:33:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110569356] [2024-11-12 13:33:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:28,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:33:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:28,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:33:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:33:28,766 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:28,929 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2024-11-12 13:33:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:33:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-12 13:33:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:28,932 INFO L225 Difference]: With dead ends: 147 [2024-11-12 13:33:28,932 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 13:33:28,932 INFO L434 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-12 13:33:28,933 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:28,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 239 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 13:33:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2024-11-12 13:33:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 116 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:33:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-12 13:33:28,949 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2024-11-12 13:33:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-12 13:33:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-12 13:33:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:33:28,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:28,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:28,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:33:28,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:28,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1628966072, now seen corresponding path program 1 times [2024-11-12 13:33:28,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355971548] [2024-11-12 13:33:28,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355971548] [2024-11-12 13:33:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355971548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:33:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732930653] [2024-11-12 13:33:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:29,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:33:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:33:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:33:29,116 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:29,255 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2024-11-12 13:33:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:33:29,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-12 13:33:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:29,256 INFO L225 Difference]: With dead ends: 146 [2024-11-12 13:33:29,256 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 13:33:29,256 INFO L434 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-12 13:33:29,257 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:29,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 13:33:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2024-11-12 13:33:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 115 states have internal predecessors, (121), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 13:33:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2024-11-12 13:33:29,264 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2024-11-12 13:33:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:29,264 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2024-11-12 13:33:29,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2024-11-12 13:33:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:33:29,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:29,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:33:29,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -614116727, now seen corresponding path program 1 times [2024-11-12 13:33:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371221357] [2024-11-12 13:33:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,664 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-12 13:33:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:29,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371221357] [2024-11-12 13:33:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371221357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:29,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288997950] [2024-11-12 13:33:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:29,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:29,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:29,666 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:30,114 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2024-11-12 13:33:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-12 13:33:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:30,116 INFO L225 Difference]: With dead ends: 169 [2024-11-12 13:33:30,116 INFO L226 Difference]: Without dead ends: 169 [2024-11-12 13:33:30,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:33:30,117 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:30,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 488 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:33:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-12 13:33:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2024-11-12 13:33:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 126 states have internal predecessors, (146), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-12 13:33:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2024-11-12 13:33:30,127 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 25 [2024-11-12 13:33:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:30,127 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2024-11-12 13:33:30,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2024-11-12 13:33:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:33:30,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:30,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:30,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:33:30,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:30,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash -614116726, now seen corresponding path program 1 times [2024-11-12 13:33:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655837103] [2024-11-12 13:33:30,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:30,495 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-12 13:33:30,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655837103] [2024-11-12 13:33:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655837103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:33:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593375971] [2024-11-12 13:33:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:33:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:33:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:33:30,497 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:30,916 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2024-11-12 13:33:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:30,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-12 13:33:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:30,917 INFO L225 Difference]: With dead ends: 187 [2024-11-12 13:33:30,917 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 13:33:30,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:33:30,918 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 71 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:30,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 529 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:33:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 13:33:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2024-11-12 13:33:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.607843137254902) internal successors, (164), 140 states have internal predecessors, (164), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (24), 21 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-12 13:33:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-12 13:33:30,934 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 25 [2024-11-12 13:33:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:30,934 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-12 13:33:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-12 13:33:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:33:30,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:30,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:33:30,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:30,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -687002123, now seen corresponding path program 1 times [2024-11-12 13:33:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193061344] [2024-11-12 13:33:30,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:33:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:33:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193061344] [2024-11-12 13:33:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193061344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638042711] [2024-11-12 13:33:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:31,095 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-12 13:33:31,099 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-12 13:33:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:33:31,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:31,243 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-12 13:33:31,312 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-12 13:33:31,349 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:31,349 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-12 13:33:31,356 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-12 13:33:31,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:31,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638042711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:31,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-12 13:33:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647966961] [2024-11-12 13:33:31,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:31,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:33:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:31,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:33:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-12 13:33:31,511 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:33:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,004 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2024-11-12 13:33:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:32,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2024-11-12 13:33:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,006 INFO L225 Difference]: With dead ends: 181 [2024-11-12 13:33:32,006 INFO L226 Difference]: Without dead ends: 181 [2024-11-12 13:33:32,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2024-11-12 13:33:32,007 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 93 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 477 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 509 Invalid, 0 Unknown, 167 Unchecked, 0.4s Time] [2024-11-12 13:33:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-12 13:33:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2024-11-12 13:33:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 140 states have internal predecessors, (165), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-12 13:33:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-11-12 13:33:32,019 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 28 [2024-11-12 13:33:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,019 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-11-12 13:33:32,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:33:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-11-12 13:33:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:33:32,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,036 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-12 13:33:32,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:32,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:32,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -687002122, now seen corresponding path program 1 times [2024-11-12 13:33:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193691458] [2024-11-12 13:33:32,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:33:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:33:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,500 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-12 13:33:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193691458] [2024-11-12 13:33:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193691458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702457749] [2024-11-12 13:33:32,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:32,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:32,505 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-12 13:33:32,506 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-12 13:33:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:33:32,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:32,590 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-12 13:33:32,687 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-12 13:33:32,707 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:32,707 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-12 13:33:32,716 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-12 13:33:32,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702457749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:32,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-12 13:33:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276654680] [2024-11-12 13:33:32,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:33:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:33:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-11-12 13:33:32,775 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:33:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:33,207 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2024-11-12 13:33:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:33:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-12 13:33:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:33,208 INFO L225 Difference]: With dead ends: 183 [2024-11-12 13:33:33,208 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 13:33:33,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:33:33,209 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:33,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 599 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 622 Invalid, 0 Unknown, 168 Unchecked, 0.3s Time] [2024-11-12 13:33:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 13:33:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-11-12 13:33:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 142 states have internal predecessors, (166), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-12 13:33:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2024-11-12 13:33:33,218 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 28 [2024-11-12 13:33:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:33,218 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2024-11-12 13:33:33,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:33:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2024-11-12 13:33:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:33:33,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:33,219 INFO L218 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] [2024-11-12 13:33:33,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:33:33,423 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,SelfDestructingSolverStorable7 [2024-11-12 13:33:33,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:33,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -742476013, now seen corresponding path program 1 times [2024-11-12 13:33:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993072256] [2024-11-12 13:33:33,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:33:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,911 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-12 13:33:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993072256] [2024-11-12 13:33:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993072256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041706931] [2024-11-12 13:33:33,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:33,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:33,915 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-12 13:33:33,920 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-12 13:33:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 13:33:34,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:34,002 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-12 13:33:34,029 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-12 13:33:34,057 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-12 13:33:34,282 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-12 13:33:34,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-12 13:33:34,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:34,554 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-12 13:33:34,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 12 [2024-11-12 13:33:34,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:34,652 INFO L349 Elim1Store]: treesize reduction 425, result has 0.2 percent of original size [2024-11-12 13:33:34,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 75 treesize of output 1 [2024-11-12 13:33:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-12 13:33:34,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041706931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:35,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-12 13:33:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431722782] [2024-11-12 13:33:35,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:33:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:33:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=222, Unknown=2, NotChecked=62, Total=342 [2024-11-12 13:33:35,005 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-12 13:33:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:36,035 INFO L93 Difference]: Finished difference Result 204 states and 257 transitions. [2024-11-12 13:33:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 37 [2024-11-12 13:33:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:36,037 INFO L225 Difference]: With dead ends: 204 [2024-11-12 13:33:36,037 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 13:33:36,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=309, Unknown=2, NotChecked=74, Total=462 [2024-11-12 13:33:36,038 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 99 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:36,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 633 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1004 Invalid, 0 Unknown, 406 Unchecked, 0.8s Time] [2024-11-12 13:33:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 13:33:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2024-11-12 13:33:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 148 states have internal predecessors, (174), 18 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-12 13:33:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2024-11-12 13:33:36,044 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 37 [2024-11-12 13:33:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2024-11-12 13:33:36,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-12 13:33:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2024-11-12 13:33:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:33:36,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:36,046 INFO L218 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] [2024-11-12 13:33:36,061 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-12 13:33:36,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:36,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:36,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -742476012, now seen corresponding path program 1 times [2024-11-12 13:33:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328089959] [2024-11-12 13:33:36,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:33:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,035 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-12 13:33:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328089959] [2024-11-12 13:33:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328089959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796238509] [2024-11-12 13:33:37,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:37,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:37,038 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-12 13:33:37,044 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-12 13:33:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 13:33:37,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:37,170 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-12 13:33:37,174 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-12 13:33:37,427 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-12 13:33:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:37,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:37,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-12 13:33:37,561 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-12 13:33:37,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-12 13:33:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-12 13:33:37,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796238509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:37,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2024-11-12 13:33:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663867046] [2024-11-12 13:33:37,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:37,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-12 13:33:37,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:37,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 13:33:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2024-11-12 13:33:37,778 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:33:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:38,772 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2024-11-12 13:33:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:33:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2024-11-12 13:33:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:38,773 INFO L225 Difference]: With dead ends: 226 [2024-11-12 13:33:38,773 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 13:33:38,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=854, Unknown=1, NotChecked=60, Total=1056 [2024-11-12 13:33:38,776 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 191 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:38,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 646 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1226 Invalid, 0 Unknown, 228 Unchecked, 0.8s Time] [2024-11-12 13:33:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 13:33:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 173. [2024-11-12 13:33:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 145 states have internal predecessors, (170), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-12 13:33:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2024-11-12 13:33:38,785 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 37 [2024-11-12 13:33:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-11-12 13:33:38,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 states have internal predecessors, (56), 7 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 13:33:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2024-11-12 13:33:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:33:38,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:38,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:38,802 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-12 13:33:38,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:38,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:38,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2117597909, now seen corresponding path program 1 times [2024-11-12 13:33:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691623754] [2024-11-12 13:33:38,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:33:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:33:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 13:33:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:33:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:39,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691623754] [2024-11-12 13:33:39,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691623754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:39,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910021888] [2024-11-12 13:33:39,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:39,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:39,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:39,245 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-12 13:33:39,246 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-12 13:33:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:33:39,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:39,346 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-12 13:33:39,364 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-12 13:33:39,373 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-12 13:33:39,401 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-12 13:33:39,418 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:39,418 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-12 13:33:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-12 13:33:39,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910021888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:39,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-12 13:33:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101573183] [2024-11-12 13:33:39,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:33:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:33:39,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:33:39,516 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 13:33:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:39,940 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2024-11-12 13:33:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:33:39,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-11-12 13:33:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:39,941 INFO L225 Difference]: With dead ends: 188 [2024-11-12 13:33:39,941 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 13:33:39,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=314, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:33:39,942 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 101 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:39,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 594 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 672 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2024-11-12 13:33:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 13:33:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2024-11-12 13:33:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 144 states have internal predecessors, (169), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-12 13:33:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2024-11-12 13:33:39,947 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 40 [2024-11-12 13:33:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2024-11-12 13:33:39,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 13:33:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2024-11-12 13:33:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:33:39,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:39,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:39,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:40,152 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,SelfDestructingSolverStorable10 [2024-11-12 13:33:40,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2117597908, now seen corresponding path program 1 times [2024-11-12 13:33:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956772072] [2024-11-12 13:33:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:33:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:33:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 13:33:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,503 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-12 13:33:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956772072] [2024-11-12 13:33:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956772072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171244863] [2024-11-12 13:33:40,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:40,506 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-12 13:33:40,507 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-12 13:33:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:33:40,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:40,606 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-12 13:33:40,659 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-12 13:33:40,662 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-12 13:33:40,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 13:33:40,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-12 13:33:40,759 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:40,759 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-12 13:33:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-12 13:33:40,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:41,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171244863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:41,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:41,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-12 13:33:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456423946] [2024-11-12 13:33:41,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:41,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:33:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:33:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=628, Unknown=1, NotChecked=50, Total=756 [2024-11-12 13:33:41,048 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:33:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:41,972 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2024-11-12 13:33:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:33:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2024-11-12 13:33:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:41,973 INFO L225 Difference]: With dead ends: 186 [2024-11-12 13:33:41,973 INFO L226 Difference]: Without dead ends: 186 [2024-11-12 13:33:41,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1114, Unknown=1, NotChecked=68, Total=1332 [2024-11-12 13:33:41,974 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 137 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:41,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 881 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 892 Invalid, 0 Unknown, 165 Unchecked, 0.6s Time] [2024-11-12 13:33:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-12 13:33:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2024-11-12 13:33:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 142 states have internal predecessors, (167), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (25), 22 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-12 13:33:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2024-11-12 13:33:41,978 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 40 [2024-11-12 13:33:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2024-11-12 13:33:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 4 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:33:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2024-11-12 13:33:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:33:41,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:41,980 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2024-11-12 13:33:41,992 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-12 13:33:42,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:42,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 43201550, now seen corresponding path program 1 times [2024-11-12 13:33:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866416836] [2024-11-12 13:33:42,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:33:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866416836] [2024-11-12 13:33:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866416836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:42,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:42,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093589061] [2024-11-12 13:33:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:42,261 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:42,477 INFO L93 Difference]: Finished difference Result 211 states and 271 transitions. [2024-11-12 13:33:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:42,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-12 13:33:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:42,478 INFO L225 Difference]: With dead ends: 211 [2024-11-12 13:33:42,478 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 13:33:42,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-12 13:33:42,479 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:42,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 355 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 13:33:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2024-11-12 13:33:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.5813953488372092) internal successors, (204), 159 states have internal predecessors, (204), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (29), 26 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-12 13:33:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 253 transitions. [2024-11-12 13:33:42,484 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 253 transitions. Word has length 47 [2024-11-12 13:33:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:42,484 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 253 transitions. [2024-11-12 13:33:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 253 transitions. [2024-11-12 13:33:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:33:42,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:42,485 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2024-11-12 13:33:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:33:42,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:42,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash 43201551, now seen corresponding path program 1 times [2024-11-12 13:33:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472790375] [2024-11-12 13:33:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:33:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472790375] [2024-11-12 13:33:42,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472790375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:42,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856796106] [2024-11-12 13:33:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:42,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:42,658 INFO L87 Difference]: Start difference. First operand 191 states and 253 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:42,937 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2024-11-12 13:33:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-12 13:33:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:42,938 INFO L225 Difference]: With dead ends: 218 [2024-11-12 13:33:42,938 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 13:33:42,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:33:42,939 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:42,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 618 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:33:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 13:33:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 201. [2024-11-12 13:33:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 167 states have internal predecessors, (213), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-12 13:33:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 266 transitions. [2024-11-12 13:33:42,945 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 266 transitions. Word has length 47 [2024-11-12 13:33:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:42,945 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 266 transitions. [2024-11-12 13:33:42,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 266 transitions. [2024-11-12 13:33:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:33:42,946 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:42,946 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-11-12 13:33:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:33:42,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1433023742, now seen corresponding path program 1 times [2024-11-12 13:33:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467237421] [2024-11-12 13:33:42,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:33:43,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467237421] [2024-11-12 13:33:43,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467237421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:43,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:43,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622888169] [2024-11-12 13:33:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:43,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:33:43,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:33:43,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:43,086 INFO L87 Difference]: Start difference. First operand 201 states and 266 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:43,289 INFO L93 Difference]: Finished difference Result 222 states and 293 transitions. [2024-11-12 13:33:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-12 13:33:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:43,290 INFO L225 Difference]: With dead ends: 222 [2024-11-12 13:33:43,291 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 13:33:43,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-12 13:33:43,291 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:43,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 690 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 13:33:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2024-11-12 13:33:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.536231884057971) internal successors, (212), 168 states have internal predecessors, (212), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (31), 28 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-12 13:33:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 265 transitions. [2024-11-12 13:33:43,300 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 265 transitions. Word has length 49 [2024-11-12 13:33:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:43,301 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 265 transitions. [2024-11-12 13:33:43,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:33:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 265 transitions. [2024-11-12 13:33:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:33:43,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:43,302 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:33:43,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:43,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1593016213, now seen corresponding path program 1 times [2024-11-12 13:33:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242376072] [2024-11-12 13:33:43,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:33:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242376072] [2024-11-12 13:33:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242376072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591853875] [2024-11-12 13:33:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:44,096 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-12 13:33:44,097 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-12 13:33:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-12 13:33:44,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:44,242 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-12 13:33:44,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:33:44,355 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-12 13:33:44,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:44,403 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 20 treesize of output 15 [2024-11-12 13:33:44,422 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-12 13:33:44,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2024-11-12 13:33:44,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 13:33:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 13:33:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-12 13:33:44,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591853875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:45,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 32 [2024-11-12 13:33:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405302027] [2024-11-12 13:33:45,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 13:33:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 13:33:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1226, Unknown=1, NotChecked=70, Total=1406 [2024-11-12 13:33:45,220 INFO L87 Difference]: Start difference. First operand 202 states and 265 transitions. Second operand has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:33:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:47,007 INFO L93 Difference]: Finished difference Result 253 states and 330 transitions. [2024-11-12 13:33:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:33:47,007 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 51 [2024-11-12 13:33:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:47,009 INFO L225 Difference]: With dead ends: 253 [2024-11-12 13:33:47,009 INFO L226 Difference]: Without dead ends: 253 [2024-11-12 13:33:47,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=2452, Unknown=1, NotChecked=100, Total=2756 [2024-11-12 13:33:47,010 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 101 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:47,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1713 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2767 Invalid, 0 Unknown, 218 Unchecked, 1.2s Time] [2024-11-12 13:33:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-12 13:33:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2024-11-12 13:33:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 159 states have (on average 1.5157232704402517) internal successors, (241), 189 states have internal predecessors, (241), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (41), 30 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-12 13:33:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 305 transitions. [2024-11-12 13:33:47,021 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 305 transitions. Word has length 51 [2024-11-12 13:33:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:47,021 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 305 transitions. [2024-11-12 13:33:47,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 13:33:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-12 13:33:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:33:47,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:47,022 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:47,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:47,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1593016214, now seen corresponding path program 1 times [2024-11-12 13:33:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944669215] [2024-11-12 13:33:47,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:33:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:48,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944669215] [2024-11-12 13:33:48,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944669215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:48,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877645683] [2024-11-12 13:33:48,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:48,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:48,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:48,472 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-12 13:33:48,473 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-12 13:33:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:48,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-12 13:33:48,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:33:48,630 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-12 13:33:48,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:33:48,760 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-12 13:33:48,878 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-12 13:33:48,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:48,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 31 treesize of output 24 [2024-11-12 13:33:48,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:48,946 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 20 treesize of output 15 [2024-11-12 13:33:48,962 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2024-11-12 13:33:48,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2024-11-12 13:33:48,966 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 18 treesize of output 13 [2024-11-12 13:33:49,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 13:33:49,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 13:33:49,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 13:33:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-12 13:33:49,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:49,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877645683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:49,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:49,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 32 [2024-11-12 13:33:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213725648] [2024-11-12 13:33:49,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:49,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 13:33:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 13:33:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1436, Unknown=1, NotChecked=76, Total=1640 [2024-11-12 13:33:49,569 INFO L87 Difference]: Start difference. First operand 226 states and 305 transitions. Second operand has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-12 13:33:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:51,321 INFO L93 Difference]: Finished difference Result 271 states and 356 transitions. [2024-11-12 13:33:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:33:51,322 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 51 [2024-11-12 13:33:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:51,323 INFO L225 Difference]: With dead ends: 271 [2024-11-12 13:33:51,323 INFO L226 Difference]: Without dead ends: 271 [2024-11-12 13:33:51,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=2552, Unknown=1, NotChecked=102, Total=2862 [2024-11-12 13:33:51,324 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:51,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1494 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2127 Invalid, 0 Unknown, 221 Unchecked, 1.0s Time] [2024-11-12 13:33:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-12 13:33:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 246. [2024-11-12 13:33:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 176 states have (on average 1.4943181818181819) internal successors, (263), 206 states have internal predecessors, (263), 25 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (45), 32 states have call predecessors, (45), 25 states have call successors, (45) [2024-11-12 13:33:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2024-11-12 13:33:51,329 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 51 [2024-11-12 13:33:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:51,330 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2024-11-12 13:33:51,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.310344827586207) internal successors, (67), 25 states have internal predecessors, (67), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-12 13:33:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2024-11-12 13:33:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:33:51,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:51,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:51,344 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-12 13:33:51,534 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,SelfDestructingSolverStorable16 [2024-11-12 13:33:51,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:33:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1842636325, now seen corresponding path program 1 times [2024-11-12 13:33:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91137623] [2024-11-12 13:33:51,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:33:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:33:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:33:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:33:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91137623] [2024-11-12 13:33:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91137623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212549182] [2024-11-12 13:33:52,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:52,913 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-12 13:33:52,914 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-12 13:33:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:53,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-12 13:33:53,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:53,039 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-12 13:33:53,197 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-12 13:33:53,203 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-12 13:33:53,475 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:33:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:33:53,551 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-12 13:33:53,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 33 treesize of output 17 [2024-11-12 13:33:53,707 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-12 13:33:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:53,759 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-12 13:33:53,759 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 56 treesize of output 51 [2024-11-12 13:33:53,775 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-12 13:33:53,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-12 13:33:53,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-12 13:33:53,844 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-12 13:33:53,844 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 56 treesize of output 34 [2024-11-12 13:33:53,849 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 42 treesize of output 29 [2024-11-12 13:33:54,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:54,303 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-12 13:33:54,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-12 13:33:54,311 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:33:54,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-12 13:33:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-12 13:33:54,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212549182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:59,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2024-11-12 13:33:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033402298] [2024-11-12 13:33:59,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 13:33:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:59,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 13:33:59,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=3045, Unknown=2, NotChecked=110, Total=3306 [2024-11-12 13:33:59,431 INFO L87 Difference]: Start difference. First operand 246 states and 333 transitions. Second operand has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-12 13:34:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:03,521 INFO L93 Difference]: Finished difference Result 284 states and 374 transitions. [2024-11-12 13:34:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 13:34:03,522 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 54 [2024-11-12 13:34:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:03,523 INFO L225 Difference]: With dead ends: 284 [2024-11-12 13:34:03,523 INFO L226 Difference]: Without dead ends: 284 [2024-11-12 13:34:03,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=297, Invalid=5711, Unknown=2, NotChecked=152, Total=6162 [2024-11-12 13:34:03,525 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 119 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 3844 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:03,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2365 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3844 Invalid, 0 Unknown, 232 Unchecked, 2.3s Time] [2024-11-12 13:34:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-12 13:34:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 245. [2024-11-12 13:34:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 175 states have (on average 1.48) internal successors, (259), 205 states have internal predecessors, (259), 25 states have call successors, (25), 7 states have call predecessors, (25), 9 states have return successors, (45), 32 states have call predecessors, (45), 25 states have call successors, (45) [2024-11-12 13:34:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 329 transitions. [2024-11-12 13:34:03,533 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 329 transitions. Word has length 54 [2024-11-12 13:34:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:03,534 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 329 transitions. [2024-11-12 13:34:03,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 37 states have internal predecessors, (81), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-12 13:34:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 329 transitions. [2024-11-12 13:34:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:34:03,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:03,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:03,548 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-12 13:34:03,738 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,SelfDestructingSolverStorable17 [2024-11-12 13:34:03,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:03,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -809263971, now seen corresponding path program 2 times [2024-11-12 13:34:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357242041] [2024-11-12 13:34:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:34:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:34:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:34:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357242041] [2024-11-12 13:34:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357242041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26046546] [2024-11-12 13:34:05,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:34:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:05,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:05,091 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-12 13:34:05,092 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-12 13:34:05,217 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:34:05,217 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:34:05,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 13:34:05,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:34:05,227 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-12 13:34:05,309 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-12 13:34:05,339 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) |c_create_internal_#t~ret7.base| (select |c_#valid| |c_create_internal_#t~ret7.base|)))) is different from true [2024-11-12 13:34:05,343 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-12 13:34:05,346 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset))) (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) .cse0 (select |c_#valid| .cse0))))) is different from true [2024-11-12 13:34:05,350 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 27 treesize of output 15 [2024-11-12 13:34:05,353 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) |c_create_internal_#t~mem8.base| (select |c_#valid| |c_create_internal_#t~mem8.base|)))) is different from true [2024-11-12 13:34:05,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)))) is different from true [2024-11-12 13:34:05,377 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (not (= v_alloc_and_zero_internal_~pi~1.base_92 c_create_internal_~now~0.base)) (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) v_alloc_and_zero_internal_~pi~1.base_92 1))))) is different from true [2024-11-12 13:34:05,523 INFO L349 Elim1Store]: treesize reduction 137, result has 16.0 percent of original size [2024-11-12 13:34:05,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 79 [2024-11-12 13:34:05,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:05,700 INFO L349 Elim1Store]: treesize reduction 220, result has 2.2 percent of original size [2024-11-12 13:34:05,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 25 [2024-11-12 13:34:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2024-11-12 13:34:05,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:34:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26046546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:05,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:34:05,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 27 [2024-11-12 13:34:05,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827374702] [2024-11-12 13:34:05,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:34:05,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:34:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:34:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=456, Unknown=9, NotChecked=306, Total=930 [2024-11-12 13:34:05,940 INFO L87 Difference]: Start difference. First operand 245 states and 329 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:34:06,836 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) create_internal_~now~0.base 1) v_alloc_and_zero_internal_~pi~1.base_92 1)) (not (= create_internal_~now~0.base v_alloc_and_zero_internal_~pi~1.base_92)))) (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) create_internal_~now~0.base 1)))) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_92 Int)) (and (not (= v_alloc_and_zero_internal_~pi~1.base_92 c_create_internal_~now~0.base)) (= |c_#valid| (store (store (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1) c_create_internal_~now~0.base (select |c_#valid| c_create_internal_~now~0.base)) v_alloc_and_zero_internal_~pi~1.base_92 1)))))) is different from true [2024-11-12 13:34:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:07,350 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2024-11-12 13:34:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:34:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 49 [2024-11-12 13:34:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:07,352 INFO L225 Difference]: With dead ends: 299 [2024-11-12 13:34:07,352 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 13:34:07,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=831, Unknown=10, NotChecked=490, Total=1640 [2024-11-12 13:34:07,353 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 163 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1376 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:07,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 685 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1000 Invalid, 2 Unknown, 1376 Unchecked, 1.0s Time] [2024-11-12 13:34:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 13:34:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 256. [2024-11-12 13:34:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 184 states have (on average 1.4673913043478262) internal successors, (270), 214 states have internal predecessors, (270), 26 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (56), 34 states have call predecessors, (56), 26 states have call successors, (56) [2024-11-12 13:34:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 352 transitions. [2024-11-12 13:34:07,359 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 352 transitions. Word has length 49 [2024-11-12 13:34:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 352 transitions. [2024-11-12 13:34:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 21 states have internal predecessors, (63), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:34:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 352 transitions. [2024-11-12 13:34:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:34:07,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:07,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:07,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:34:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:07,561 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:07,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash -809263970, now seen corresponding path program 2 times [2024-11-12 13:34:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868640266] [2024-11-12 13:34:07,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:34:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 13:34:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:34:14,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:14,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868640266] [2024-11-12 13:34:14,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868640266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:14,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120413757] [2024-11-12 13:34:14,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:34:14,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:14,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:14,728 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-12 13:34:14,731 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-12 13:34:14,862 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:34:14,863 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:34:14,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 13:34:14,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:34:14,875 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-12 13:34:14,879 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-12 13:34:15,005 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-12 13:34:15,050 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-12 13:34:15,177 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-12 13:34:15,509 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2024-11-12 13:34:15,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 124 [2024-11-12 13:34:15,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:34:15,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 127 treesize of output 233 [2024-11-12 13:34:17,394 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2024-11-12 13:34:17,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 16 [2024-11-12 13:34:17,436 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-12 13:34:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2024-11-12 13:34:17,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:34:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120413757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:17,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:34:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2024-11-12 13:34:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667940494] [2024-11-12 13:34:17,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:34:17,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 13:34:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 13:34:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=702, Unknown=3, NotChecked=168, Total=992 [2024-11-12 13:34:17,771 INFO L87 Difference]: Start difference. First operand 256 states and 352 transitions. Second operand has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-12 13:34:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:23,413 INFO L93 Difference]: Finished difference Result 311 states and 424 transitions. [2024-11-12 13:34:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:34:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 49 [2024-11-12 13:34:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:23,416 INFO L225 Difference]: With dead ends: 311 [2024-11-12 13:34:23,416 INFO L226 Difference]: Without dead ends: 311 [2024-11-12 13:34:23,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=155, Invalid=909, Unknown=4, NotChecked=192, Total=1260 [2024-11-12 13:34:23,416 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:23,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 851 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1450 Invalid, 0 Unknown, 719 Unchecked, 1.3s Time] [2024-11-12 13:34:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-12 13:34:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 252. [2024-11-12 13:34:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 181 states have (on average 1.4696132596685083) internal successors, (266), 211 states have internal predecessors, (266), 26 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (46), 33 states have call predecessors, (46), 26 states have call successors, (46) [2024-11-12 13:34:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 338 transitions. [2024-11-12 13:34:23,422 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 338 transitions. Word has length 49 [2024-11-12 13:34:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:23,423 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 338 transitions. [2024-11-12 13:34:23,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-12 13:34:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 338 transitions. [2024-11-12 13:34:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:34:23,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:23,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:23,441 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-12 13:34:23,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:23,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:23,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash -611936955, now seen corresponding path program 1 times [2024-11-12 13:34:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:23,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710826911] [2024-11-12 13:34:23,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:34:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:34:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:34:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710826911] [2024-11-12 13:34:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710826911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:24,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 13:34:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231977520] [2024-11-12 13:34:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:24,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:34:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:34:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:34:24,033 INFO L87 Difference]: Start difference. First operand 252 states and 338 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:34:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:24,749 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2024-11-12 13:34:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:34:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-12 13:34:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:24,753 INFO L225 Difference]: With dead ends: 286 [2024-11-12 13:34:24,754 INFO L226 Difference]: Without dead ends: 286 [2024-11-12 13:34:24,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:34:24,755 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 54 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:24,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1152 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:34:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-12 13:34:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2024-11-12 13:34:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 220 states have internal predecessors, (280), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2024-11-12 13:34:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2024-11-12 13:34:24,760 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 58 [2024-11-12 13:34:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:24,760 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2024-11-12 13:34:24,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:34:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2024-11-12 13:34:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:34:24,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:24,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:34:24,761 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -611936954, now seen corresponding path program 1 times [2024-11-12 13:34:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570355164] [2024-11-12 13:34:24,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:34:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 13:34:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:34:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570355164] [2024-11-12 13:34:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570355164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:34:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:34:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 13:34:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867877276] [2024-11-12 13:34:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:34:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:34:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:34:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:34:25,380 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:34:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:26,338 INFO L93 Difference]: Finished difference Result 286 states and 374 transitions. [2024-11-12 13:34:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:34:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-12 13:34:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:26,341 INFO L225 Difference]: With dead ends: 286 [2024-11-12 13:34:26,341 INFO L226 Difference]: Without dead ends: 286 [2024-11-12 13:34:26,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:34:26,342 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:26,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1240 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:34:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-12 13:34:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2024-11-12 13:34:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 220 states have internal predecessors, (279), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (47), 34 states have call predecessors, (47), 27 states have call successors, (47) [2024-11-12 13:34:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 353 transitions. [2024-11-12 13:34:26,348 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 353 transitions. Word has length 58 [2024-11-12 13:34:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:26,349 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 353 transitions. [2024-11-12 13:34:26,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:34:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2024-11-12 13:34:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 13:34:26,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:26,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:26,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:34:26,350 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:26,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1325109, now seen corresponding path program 1 times [2024-11-12 13:34:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:26,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481306827] [2024-11-12 13:34:26,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:26,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:34:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:34:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:34:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481306827] [2024-11-12 13:34:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481306827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076333670] [2024-11-12 13:34:28,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:28,606 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-12 13:34:28,607 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-12 13:34:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:28,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-12 13:34:28,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:34:28,795 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-12 13:34:28,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 13:34:29,252 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-12 13:34:29,801 INFO L349 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2024-11-12 13:34:29,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 99 [2024-11-12 13:34:29,938 INFO L349 Elim1Store]: treesize reduction 289, result has 24.9 percent of original size [2024-11-12 13:34:29,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 62 treesize of output 158 [2024-11-12 13:34:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2024-11-12 13:34:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:30,403 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:34:30,403 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 2 case distinctions, treesize of input 47 treesize of output 28 [2024-11-12 13:34:30,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:34:30,476 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-12 13:34:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 39 [2024-11-12 13:34:30,956 INFO L349 Elim1Store]: treesize reduction 567, result has 20.9 percent of original size [2024-11-12 13:34:30,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 84 treesize of output 238 [2024-11-12 13:34:31,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,729 INFO L349 Elim1Store]: treesize reduction 50, result has 13.8 percent of original size [2024-11-12 13:34:31,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 45 [2024-11-12 13:34:31,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,758 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-12 13:34:31,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2024-11-12 13:34:31,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,788 INFO L349 Elim1Store]: treesize reduction 159, result has 0.6 percent of original size [2024-11-12 13:34:31,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 58 treesize of output 1 [2024-11-12 13:34:31,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,805 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-12 13:34:31,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2024-11-12 13:34:31,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,835 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-11-12 13:34:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 37 [2024-11-12 13:34:31,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:31,968 INFO L349 Elim1Store]: treesize reduction 101, result has 16.5 percent of original size [2024-11-12 13:34:31,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 36 [2024-11-12 13:34:31,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:34:32,001 INFO L349 Elim1Store]: treesize reduction 116, result has 0.9 percent of original size [2024-11-12 13:34:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 1 [2024-11-12 13:34:32,836 INFO L349 Elim1Store]: treesize reduction 392, result has 25.9 percent of original size [2024-11-12 13:34:32,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 467 treesize of output 546 [2024-11-12 13:34:33,156 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 0 case distinctions, treesize of input 310 treesize of output 255 [2024-11-12 13:34:34,346 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 327 treesize of output 249 [2024-11-12 13:34:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-12 13:34:35,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:34:35,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_alloc_and_zero_internal_~pi~1.base_143 Int) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2018 Int) (v_ArrVal_1998 Int) (v_create_internal_~sll~0.base_31 Int)) (let ((.cse0 (store |c_#valid| v_create_internal_~sll~0.base_31 v_ArrVal_2018))) (or (not (= (select .cse0 v_alloc_and_zero_internal_~pi~1.base_143) 0)) (= (select (store .cse0 v_alloc_and_zero_internal_~pi~1.base_143 1) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_143 v_ArrVal_2016) v_create_internal_~sll~0.base_31 v_ArrVal_2017))) (store .cse1 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) (+ |c_ULTIMATE.start_create_~now~1#1.offset| 16) v_ArrVal_1998))) |c_ULTIMATE.start_create_~sll~1#1.base|) (+ 8 |c_ULTIMATE.start_create_~sll~1#1.offset|))) 1) (not (= (select |c_#valid| v_create_internal_~sll~0.base_31) 0))))) is different from false [2024-11-12 13:34:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076333670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:35,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:34:35,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26] total 50 [2024-11-12 13:34:35,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721365949] [2024-11-12 13:34:35,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:34:35,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-12 13:34:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:34:35,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-12 13:34:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2675, Unknown=5, NotChecked=210, Total=3080 [2024-11-12 13:34:35,911 INFO L87 Difference]: Start difference. First operand 263 states and 353 transitions. Second operand has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 13:34:40,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:34:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:34:42,307 INFO L93 Difference]: Finished difference Result 314 states and 419 transitions. [2024-11-12 13:34:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 13:34:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 63 [2024-11-12 13:34:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:34:42,309 INFO L225 Difference]: With dead ends: 314 [2024-11-12 13:34:42,309 INFO L226 Difference]: Without dead ends: 314 [2024-11-12 13:34:42,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=326, Invalid=4507, Unknown=5, NotChecked=274, Total=5112 [2024-11-12 13:34:42,311 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 180 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:34:42,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1301 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2481 Invalid, 2 Unknown, 241 Unchecked, 4.3s Time] [2024-11-12 13:34:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-12 13:34:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2024-11-12 13:34:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 211 states have (on average 1.4597156398104265) internal successors, (308), 241 states have internal predecessors, (308), 28 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (58), 36 states have call predecessors, (58), 28 states have call successors, (58) [2024-11-12 13:34:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 394 transitions. [2024-11-12 13:34:42,318 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 394 transitions. Word has length 63 [2024-11-12 13:34:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:34:42,319 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 394 transitions. [2024-11-12 13:34:42,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 37 states have internal predecessors, (91), 11 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 13:34:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 394 transitions. [2024-11-12 13:34:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 13:34:42,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:34:42,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:34:42,334 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-12 13:34:42,520 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,SelfDestructingSolverStorable22 [2024-11-12 13:34:42,520 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [loop_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, loop_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-12 13:34:42,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:34:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1325108, now seen corresponding path program 1 times [2024-11-12 13:34:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:34:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599346610] [2024-11-12 13:34:42,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:34:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:34:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 13:34:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 13:34:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-12 13:34:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 13:34:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:34:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:34:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599346610] [2024-11-12 13:34:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599346610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:34:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323138136] [2024-11-12 13:34:46,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:34:46,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:34:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:34:46,384 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-12 13:34:46,385 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-12 13:34:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:34:46,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-12 13:34:46,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:34:46,616 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-12 13:34:46,951 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-12 13:34:46,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1