./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.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 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:07:57,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:07:57,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 18:07:57,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:07:57,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:07:57,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:07:57,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:07:57,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:07:57,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:07:57,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:07:57,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:07:57,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:07:57,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:07:57,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:07:57,708 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:07:57,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:07:57,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:07:57,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:07:57,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:07:57,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:07:57,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:07:57,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:07:57,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:07:57,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:07:57,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:07:57,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:07:57,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:07:57,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:07:57,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:07:57,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:07:57,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:07:57,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:07:57,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:07:57,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:07:57,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:07:57,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:07:57,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:07:57,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:07:57,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:07:57,718 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 -> 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d [2024-10-14 18:07:57,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:07:58,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:07:58,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:07:58,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:07:58,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:07:58,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-10-14 18:07:59,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:07:59,944 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:07:59,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-10-14 18:07:59,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a9ae119/3f19634f3fa34c29b0cfef758506fe16/FLAG9c805d524 [2024-10-14 18:08:00,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a9ae119/3f19634f3fa34c29b0cfef758506fe16 [2024-10-14 18:08:00,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:08:00,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:08:00,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:08:00,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:08:00,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:08:00,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ad2573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00, skipping insertion in model container [2024-10-14 18:08:00,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:08:00,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:08:00,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:08:00,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:08:00,730 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:08:00,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00 WrapperNode [2024-10-14 18:08:00,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:08:00,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:08:00,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:08:00,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:08:00,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,786 INFO L138 Inliner]: procedures = 120, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 87 [2024-10-14 18:08:00,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:08:00,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:08:00,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:08:00,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:08:00,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,842 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-10-14 18:08:00,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:08:00,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:08:00,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:08:00,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:08:00,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (1/1) ... [2024-10-14 18:08:00,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:08:00,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:00,921 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-10-14 18:08:00,925 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-10-14 18:08:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-10-14 18:08:00,969 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-14 18:08:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:08:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:08:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:08:01,075 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:08:01,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:08:01,398 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-14 18:08:01,398 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:08:01,448 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:08:01,449 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 18:08:01,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:08:01 BoogieIcfgContainer [2024-10-14 18:08:01,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:08:01,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:08:01,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:08:01,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:08:01,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:08:00" (1/3) ... [2024-10-14 18:08:01,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec18f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:08:01, skipping insertion in model container [2024-10-14 18:08:01,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:08:00" (2/3) ... [2024-10-14 18:08:01,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec18f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:08:01, skipping insertion in model container [2024-10-14 18:08:01,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:08:01" (3/3) ... [2024-10-14 18:08:01,463 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-before.i [2024-10-14 18:08:01,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:08:01,482 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-14 18:08:01,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:08:01,554 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;@36623ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:08:01,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-14 18:08:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 65 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:08:01,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:01,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:08:01,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:01,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash 5463475, now seen corresponding path program 1 times [2024-10-14 18:08:01,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430421988] [2024-10-14 18:08:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430421988] [2024-10-14 18:08:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430421988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:08:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767011019] [2024-10-14 18:08:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:01,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:01,878 INFO L87 Difference]: Start difference. First operand has 72 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 65 states have internal predecessors, (73), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:01,979 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-10-14 18:08:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 18:08:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:01,989 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:08:01,990 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 18:08:01,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:01,998 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:02,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 18:08:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 18:08:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 63 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-10-14 18:08:02,035 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 4 [2024-10-14 18:08:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:02,035 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-10-14 18:08:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-10-14 18:08:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:08:02,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:02,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:08:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:08:02,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:02,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 5463476, now seen corresponding path program 1 times [2024-10-14 18:08:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748624050] [2024-10-14 18:08:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748624050] [2024-10-14 18:08:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748624050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:02,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:08:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775184428] [2024-10-14 18:08:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:08:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:08:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:02,150 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:02,231 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-10-14 18:08:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:08:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 18:08:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:02,233 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:08:02,233 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:08:02,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:08:02,235 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:02,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:08:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-14 18:08:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 62 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-10-14 18:08:02,249 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 4 [2024-10-14 18:08:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:02,249 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-10-14 18:08:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:08:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-10-14 18:08:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:08:02,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:02,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:02,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:08:02,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1547906994, now seen corresponding path program 1 times [2024-10-14 18:08:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755908738] [2024-10-14 18:08:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:02,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:02,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755908738] [2024-10-14 18:08:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755908738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199954176] [2024-10-14 18:08:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:08:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:08:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:02,426 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:08:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:02,553 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-10-14 18:08:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:08:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 18:08:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:02,556 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:08:02,558 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 18:08:02,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:02,559 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:02,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 18:08:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 18:08:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 60 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-10-14 18:08:02,570 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 12 [2024-10-14 18:08:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:02,572 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-10-14 18:08:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:08:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-10-14 18:08:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:08:02,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:02,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:08:02,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1547906995, now seen corresponding path program 1 times [2024-10-14 18:08:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547346854] [2024-10-14 18:08:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547346854] [2024-10-14 18:08:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547346854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:08:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708718242] [2024-10-14 18:08:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:08:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:08:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:02,736 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:08:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:02,845 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2024-10-14 18:08:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:08:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 18:08:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:02,846 INFO L225 Difference]: With dead ends: 65 [2024-10-14 18:08:02,846 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 18:08:02,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:08:02,849 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:02,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 18:08:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 18:08:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 58 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-10-14 18:08:02,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 12 [2024-10-14 18:08:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:02,860 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-10-14 18:08:02,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:08:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2024-10-14 18:08:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:08:02,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:02,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:08:02,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 788353883, now seen corresponding path program 1 times [2024-10-14 18:08:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047053092] [2024-10-14 18:08:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047053092] [2024-10-14 18:08:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047053092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943659396] [2024-10-14 18:08:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:03,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:03,287 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-10-14 18:08:03,291 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-10-14 18:08:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:03,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:08:03,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:03,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:03,507 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-14 18:08:03,544 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:08:03,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:08:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:08:03,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:03,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943659396] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:03,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:03,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2024-10-14 18:08:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786942363] [2024-10-14 18:08:03,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:03,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:08:03,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:08:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:08:03,731 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:08:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:04,054 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-10-14 18:08:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 13 [2024-10-14 18:08:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:04,056 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:08:04,057 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:08:04,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:08:04,058 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:04,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 279 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 75 Unchecked, 0.3s Time] [2024-10-14 18:08:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:08:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-14 18:08:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 60 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-10-14 18:08:04,065 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 13 [2024-10-14 18:08:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:04,066 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-10-14 18:08:04,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:08:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-10-14 18:08:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 18:08:04,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:04,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:04,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:04,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:04,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 788353884, now seen corresponding path program 1 times [2024-10-14 18:08:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717194005] [2024-10-14 18:08:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717194005] [2024-10-14 18:08:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717194005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005716784] [2024-10-14 18:08:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:04,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:04,735 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-10-14 18:08:04,738 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-10-14 18:08:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:04,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 18:08:04,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:04,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:05,016 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-14 18:08:05,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:05,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:05,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:05,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:08:05,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005716784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:05,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:05,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-10-14 18:08:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773185222] [2024-10-14 18:08:05,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:05,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:08:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:05,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:08:05,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:08:05,188 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:08:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:05,519 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-10-14 18:08:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 13 [2024-10-14 18:08:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:05,520 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:08:05,520 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:08:05,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2024-10-14 18:08:05,521 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:05,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 336 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2024-10-14 18:08:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:08:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-10-14 18:08:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 59 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-10-14 18:08:05,527 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 13 [2024-10-14 18:08:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:05,527 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-10-14 18:08:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:08:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-10-14 18:08:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:08:05,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:05,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:05,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:08:05,733 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,SelfDestructingSolverStorable5 [2024-10-14 18:08:05,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:05,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 588517071, now seen corresponding path program 1 times [2024-10-14 18:08:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345447850] [2024-10-14 18:08:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345447850] [2024-10-14 18:08:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345447850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:08:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839774854] [2024-10-14 18:08:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:08:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:08:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:05,876 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:06,006 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-10-14 18:08:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:08:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-14 18:08:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:06,008 INFO L225 Difference]: With dead ends: 68 [2024-10-14 18:08:06,009 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 18:08:06,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:06,010 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:06,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 188 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 18:08:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-14 18:08:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 56 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-10-14 18:08:06,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 16 [2024-10-14 18:08:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:06,016 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-10-14 18:08:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-10-14 18:08:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:08:06,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:06,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 18:08:06,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 588517072, now seen corresponding path program 1 times [2024-10-14 18:08:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931607577] [2024-10-14 18:08:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931607577] [2024-10-14 18:08:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931607577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:08:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491519011] [2024-10-14 18:08:06,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:08:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:08:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:06,224 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:06,346 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2024-10-14 18:08:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:08:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-14 18:08:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:06,347 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:08:06,347 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 18:08:06,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:08:06,348 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:06,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 18:08:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-10-14 18:08:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 55 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-14 18:08:06,354 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 16 [2024-10-14 18:08:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-14 18:08:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-14 18:08:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:08:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:06,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:06,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 18:08:06,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1064676751, now seen corresponding path program 1 times [2024-10-14 18:08:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430537957] [2024-10-14 18:08:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:08:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:08:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430537957] [2024-10-14 18:08:06,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430537957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884083244] [2024-10-14 18:08:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:06,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:06,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:06,666 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-10-14 18:08:06,668 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-10-14 18:08:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:06,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 18:08:06,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:06,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:06,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:06,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:08:06,829 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-10-14 18:08:06,847 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:08:06,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:08:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 18:08:06,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884083244] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:06,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-10-14 18:08:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595219686] [2024-10-14 18:08:06,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 18:08:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 18:08:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-10-14 18:08:06,997 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 18:08:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:07,288 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-10-14 18:08:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 21 [2024-10-14 18:08:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:07,290 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:08:07,290 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:08:07,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-10-14 18:08:07,291 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:07,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 339 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2024-10-14 18:08:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:08:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-14 18:08:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-10-14 18:08:07,298 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 21 [2024-10-14 18:08:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:07,298 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-10-14 18:08:07,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 18:08:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-10-14 18:08:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:08:07,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:07,300 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:07,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:08:07,504 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-10-14 18:08:07,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1064676752, now seen corresponding path program 1 times [2024-10-14 18:08:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469494982] [2024-10-14 18:08:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:08:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:08:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469494982] [2024-10-14 18:08:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469494982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718473987] [2024-10-14 18:08:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:07,884 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-10-14 18:08:07,886 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-10-14 18:08:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:07,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 18:08:07,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:07,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:07,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:08,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:08,143 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 26 treesize of output 14 [2024-10-14 18:08:08,218 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-14 18:08:08,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:08,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:08,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 18:08:08,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718473987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:08,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-14 18:08:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422423181] [2024-10-14 18:08:08,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:08,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 18:08:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 18:08:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2024-10-14 18:08:08,401 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 18 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:08,888 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-10-14 18:08:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 21 [2024-10-14 18:08:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:08,889 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:08:08,889 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:08:08,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=561, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:08:08,890 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:08,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 532 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 473 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2024-10-14 18:08:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:08:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2024-10-14 18:08:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-14 18:08:08,895 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2024-10-14 18:08:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:08,896 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-14 18:08:08,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-14 18:08:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:08:08,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:08,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:08,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:08:09,098 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-10-14 18:08:09,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:09,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -276248669, now seen corresponding path program 1 times [2024-10-14 18:08:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:09,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510061730] [2024-10-14 18:08:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510061730] [2024-10-14 18:08:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510061730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:08:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302217246] [2024-10-14 18:08:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:09,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:08:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:08:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:08:09,340 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:09,520 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-10-14 18:08:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-14 18:08:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:09,521 INFO L225 Difference]: With dead ends: 58 [2024-10-14 18:08:09,521 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 18:08:09,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:08:09,523 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:09,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 155 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 18:08:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 18:08:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:08:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-10-14 18:08:09,531 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 21 [2024-10-14 18:08:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:09,532 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-10-14 18:08:09,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-10-14 18:08:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:08:09,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:09,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 18:08:09,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:09,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash -276248668, now seen corresponding path program 1 times [2024-10-14 18:08:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925318126] [2024-10-14 18:08:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925318126] [2024-10-14 18:08:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925318126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 18:08:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717944246] [2024-10-14 18:08:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:09,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:08:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:08:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:08:09,889 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 12 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:10,192 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-10-14 18:08:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:08:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-14 18:08:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:10,194 INFO L225 Difference]: With dead ends: 72 [2024-10-14 18:08:10,194 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 18:08:10,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:08:10,195 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:10,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 244 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 18:08:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-14 18:08:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 62 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-10-14 18:08:10,199 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 21 [2024-10-14 18:08:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:10,199 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-10-14 18:08:10,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-10-14 18:08:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:08:10,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:10,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:08:10,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 812956819, now seen corresponding path program 1 times [2024-10-14 18:08:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689924201] [2024-10-14 18:08:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689924201] [2024-10-14 18:08:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689924201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:08:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077673025] [2024-10-14 18:08:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:10,325 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:10,430 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-10-14 18:08:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:08:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-14 18:08:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:10,433 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:08:10,433 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:08:10,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:10,434 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:10,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 300 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:08:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-10-14 18:08:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-10-14 18:08:10,438 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 23 [2024-10-14 18:08:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:10,438 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-10-14 18:08:10,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-10-14 18:08:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:08:10,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:10,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 18:08:10,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:10,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 813066789, now seen corresponding path program 1 times [2024-10-14 18:08:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:10,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776072720] [2024-10-14 18:08:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776072720] [2024-10-14 18:08:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776072720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:10,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:08:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420008407] [2024-10-14 18:08:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:10,588 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:10,741 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-10-14 18:08:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:08:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-14 18:08:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:10,742 INFO L225 Difference]: With dead ends: 73 [2024-10-14 18:08:10,743 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 18:08:10,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:10,744 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:10,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 250 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 18:08:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-14 18:08:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.469387755102041) internal successors, (72), 64 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-14 18:08:10,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 23 [2024-10-14 18:08:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:10,752 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-14 18:08:10,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:08:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-14 18:08:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:08:10,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:10,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 18:08:10,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 899246978, now seen corresponding path program 1 times [2024-10-14 18:08:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170428760] [2024-10-14 18:08:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170428760] [2024-10-14 18:08:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170428760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175991708] [2024-10-14 18:08:10,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:10,987 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-10-14 18:08:10,989 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-10-14 18:08:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:08:11,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:11,126 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-14 18:08:11,160 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:08:11,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:08:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:11,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:08:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175991708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:11,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:08:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 18:08:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189799488] [2024-10-14 18:08:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:08:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:08:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-14 18:08:11,165 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:08:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:11,224 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-10-14 18:08:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:08:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 18:08:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:11,226 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:08:11,226 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:08:11,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-14 18:08:11,227 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:11,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2024-10-14 18:08:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:08:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-14 18:08:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 67 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2024-10-14 18:08:11,231 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 24 [2024-10-14 18:08:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2024-10-14 18:08:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:08:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2024-10-14 18:08:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:08:11,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:11,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:11,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:08:11,435 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,SelfDestructingSolverStorable14 [2024-10-14 18:08:11,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 899246979, now seen corresponding path program 1 times [2024-10-14 18:08:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455510281] [2024-10-14 18:08:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455510281] [2024-10-14 18:08:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455510281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426397856] [2024-10-14 18:08:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:11,807 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-10-14 18:08:11,809 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-10-14 18:08:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:11,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:08:11,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:11,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:12,063 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-14 18:08:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:12,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:12,099 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:12,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-14 18:08:12,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426397856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:12,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-10-14 18:08:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988397595] [2024-10-14 18:08:12,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:08:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:08:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:08:12,204 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:12,511 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-14 18:08:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2024-10-14 18:08:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:12,513 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:08:12,513 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:08:12,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-10-14 18:08:12,514 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:12,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2024-10-14 18:08:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:08:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-14 18:08:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 70 states have internal predecessors, (81), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-10-14 18:08:12,522 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 24 [2024-10-14 18:08:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:12,523 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-10-14 18:08:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-10-14 18:08:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:08:12,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:12,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:12,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:08:12,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:08:12,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 888010628, now seen corresponding path program 1 times [2024-10-14 18:08:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12382226] [2024-10-14 18:08:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12382226] [2024-10-14 18:08:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12382226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:08:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236401721] [2024-10-14 18:08:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:08:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:08:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:08:12,969 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:08:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:13,094 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-10-14 18:08:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-14 18:08:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:13,096 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:08:13,096 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:08:13,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:13,097 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:13,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:08:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 18:08:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 69 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2024-10-14 18:08:13,100 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 26 [2024-10-14 18:08:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2024-10-14 18:08:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:08:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2024-10-14 18:08:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:08:13,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:13,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:13,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 18:08:13,102 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:13,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash 888010627, now seen corresponding path program 1 times [2024-10-14 18:08:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347021618] [2024-10-14 18:08:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347021618] [2024-10-14 18:08:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347021618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:13,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:13,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:08:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870428241] [2024-10-14 18:08:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:13,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:08:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:08:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:08:13,309 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:08:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:13,421 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-10-14 18:08:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:08:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-10-14 18:08:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:13,422 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:08:13,422 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:08:13,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:13,423 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:13,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 221 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:08:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 18:08:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.4) internal successors, (77), 68 states have internal predecessors, (77), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2024-10-14 18:08:13,426 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 26 [2024-10-14 18:08:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:13,427 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-10-14 18:08:13,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:08:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2024-10-14 18:08:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:08:13,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:13,427 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 18:08:13,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1542715526, now seen corresponding path program 1 times [2024-10-14 18:08:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:13,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40818586] [2024-10-14 18:08:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40818586] [2024-10-14 18:08:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40818586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827001713] [2024-10-14 18:08:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:14,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:14,059 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-10-14 18:08:14,061 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-10-14 18:08:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:14,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 18:08:14,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:14,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:14,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:14,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:14,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:14,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:18,480 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from false [2024-10-14 18:08:18,483 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from true [2024-10-14 18:08:18,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:18,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 16 treesize of output 11 [2024-10-14 18:08:18,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:18,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:18,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:18,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:18,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:18,871 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-10-14 18:08:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827001713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:18,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 27 [2024-10-14 18:08:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659040695] [2024-10-14 18:08:18,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 18:08:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 18:08:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=728, Unknown=22, NotChecked=110, Total=930 [2024-10-14 18:08:18,999 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 27 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:08:19,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from false [2024-10-14 18:08:19,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from true [2024-10-14 18:08:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:19,688 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-10-14 18:08:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 18:08:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-10-14 18:08:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:19,689 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:08:19,689 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:08:19,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=116, Invalid=1201, Unknown=27, NotChecked=216, Total=1560 [2024-10-14 18:08:19,691 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:19,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 510 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 612 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2024-10-14 18:08:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:08:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-14 18:08:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 71 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-10-14 18:08:19,694 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 26 [2024-10-14 18:08:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-10-14 18:08:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:08:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-10-14 18:08:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:08:19,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:19,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:19,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 18:08:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:19,897 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -785947990, now seen corresponding path program 1 times [2024-10-14 18:08:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575094881] [2024-10-14 18:08:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575094881] [2024-10-14 18:08:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575094881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283236672] [2024-10-14 18:08:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:20,213 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-10-14 18:08:20,215 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-10-14 18:08:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:20,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:08:20,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:20,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:20,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:20,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:20,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:20,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:20,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:08:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283236672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:20,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:20,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 25 [2024-10-14 18:08:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112696297] [2024-10-14 18:08:20,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:20,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:08:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:08:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-10-14 18:08:20,700 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 26 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:21,304 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2024-10-14 18:08:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:08:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-10-14 18:08:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:21,305 INFO L225 Difference]: With dead ends: 103 [2024-10-14 18:08:21,305 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 18:08:21,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 18:08:21,307 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:21,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 336 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:08:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 18:08:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-10-14 18:08:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 82 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-10-14 18:08:21,311 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 28 [2024-10-14 18:08:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:21,312 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-10-14 18:08:21,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:08:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-10-14 18:08:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:08:21,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:21,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:21,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:08:21,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:21,518 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:21,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash -785947989, now seen corresponding path program 1 times [2024-10-14 18:08:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:21,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204155034] [2024-10-14 18:08:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204155034] [2024-10-14 18:08:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204155034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:08:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822218198] [2024-10-14 18:08:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:21,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:08:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:08:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:08:21,822 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:21,967 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2024-10-14 18:08:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:08:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-14 18:08:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:21,968 INFO L225 Difference]: With dead ends: 114 [2024-10-14 18:08:21,969 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 18:08:21,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:08:21,969 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:21,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 302 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 18:08:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-10-14 18:08:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 101 states have internal predecessors, (127), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:08:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2024-10-14 18:08:21,975 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 28 [2024-10-14 18:08:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:21,976 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2024-10-14 18:08:21,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2024-10-14 18:08:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:08:21,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:21,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:08:21,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:21,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash 887991768, now seen corresponding path program 1 times [2024-10-14 18:08:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193162623] [2024-10-14 18:08:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:08:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193162623] [2024-10-14 18:08:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193162623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302374986] [2024-10-14 18:08:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:22,395 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-10-14 18:08:22,398 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-10-14 18:08:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:22,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 18:08:22,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:22,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:22,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:22,703 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-10-14 18:08:22,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:22,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:22,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:22,808 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-14 18:08:22,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:22,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:22,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:22,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:08:22,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302374986] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:23,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2024-10-14 18:08:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555718298] [2024-10-14 18:08:23,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:23,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 18:08:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 18:08:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=451, Unknown=2, NotChecked=86, Total=600 [2024-10-14 18:08:23,010 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:08:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:23,442 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2024-10-14 18:08:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:08:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-10-14 18:08:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:23,444 INFO L225 Difference]: With dead ends: 127 [2024-10-14 18:08:23,444 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 18:08:23,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=676, Unknown=2, NotChecked=106, Total=870 [2024-10-14 18:08:23,445 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:23,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 404 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 456 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2024-10-14 18:08:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 18:08:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-14 18:08:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.392156862745098) internal successors, (142), 114 states have internal predecessors, (142), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:08:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 158 transitions. [2024-10-14 18:08:23,455 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 158 transitions. Word has length 29 [2024-10-14 18:08:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:23,455 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 158 transitions. [2024-10-14 18:08:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:08:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 158 transitions. [2024-10-14 18:08:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:08:23,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:23,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:23,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:08:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:23,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1405414659, now seen corresponding path program 1 times [2024-10-14 18:08:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569505042] [2024-10-14 18:08:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569505042] [2024-10-14 18:08:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569505042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:08:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985696253] [2024-10-14 18:08:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:23,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:23,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:23,781 INFO L87 Difference]: Start difference. First operand 125 states and 158 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:23,892 INFO L93 Difference]: Finished difference Result 131 states and 164 transitions. [2024-10-14 18:08:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:08:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-14 18:08:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:23,893 INFO L225 Difference]: With dead ends: 131 [2024-10-14 18:08:23,893 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 18:08:23,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:23,894 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:23,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 263 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 18:08:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2024-10-14 18:08:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 115 states have internal predecessors, (140), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:08:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2024-10-14 18:08:23,904 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 29 [2024-10-14 18:08:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:23,904 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2024-10-14 18:08:23,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2024-10-14 18:08:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:08:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:23,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:23,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 18:08:23,905 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 618268724, now seen corresponding path program 1 times [2024-10-14 18:08:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523745307] [2024-10-14 18:08:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523745307] [2024-10-14 18:08:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523745307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:08:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:08:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:08:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539375108] [2024-10-14 18:08:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:08:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:08:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:08:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:24,067 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:24,197 INFO L93 Difference]: Finished difference Result 130 states and 162 transitions. [2024-10-14 18:08:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:08:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-14 18:08:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:24,199 INFO L225 Difference]: With dead ends: 130 [2024-10-14 18:08:24,199 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 18:08:24,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:08:24,200 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:24,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 233 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:08:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 18:08:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-10-14 18:08:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 118 states have internal predecessors, (146), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:08:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2024-10-14 18:08:24,206 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 30 [2024-10-14 18:08:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2024-10-14 18:08:24,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:08:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2024-10-14 18:08:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:08:24,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:24,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:24,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 18:08:24,208 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1656647488, now seen corresponding path program 1 times [2024-10-14 18:08:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981967555] [2024-10-14 18:08:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981967555] [2024-10-14 18:08:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981967555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070986568] [2024-10-14 18:08:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:24,718 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-10-14 18:08:24,719 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-10-14 18:08:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:24,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 18:08:24,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:24,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:24,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:25,200 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:08:25,201 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 14 treesize of output 13 [2024-10-14 18:08:25,220 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:08:25,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:08:25,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-14 18:08:25,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:25,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:25,391 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 18:08:25,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-14 18:08:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-10-14 18:08:25,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070986568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:25,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-10-14 18:08:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099161489] [2024-10-14 18:08:25,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 18:08:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 18:08:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=829, Unknown=1, NotChecked=58, Total=992 [2024-10-14 18:08:25,594 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand has 29 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 24 states have internal predecessors, (51), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:26,107 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2024-10-14 18:08:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:08:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 24 states have internal predecessors, (51), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2024-10-14 18:08:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:26,109 INFO L225 Difference]: With dead ends: 155 [2024-10-14 18:08:26,109 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 18:08:26,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1316, Unknown=1, NotChecked=74, Total=1560 [2024-10-14 18:08:26,110 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:26,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 335 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 608 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2024-10-14 18:08:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 18:08:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-10-14 18:08:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.3650793650793651) internal successors, (172), 138 states have internal predecessors, (172), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 192 transitions. [2024-10-14 18:08:26,116 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 192 transitions. Word has length 32 [2024-10-14 18:08:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:26,116 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 192 transitions. [2024-10-14 18:08:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 24 states have internal predecessors, (51), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 192 transitions. [2024-10-14 18:08:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:08:26,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:26,118 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:26,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:26,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 18:08:26,318 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:26,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2023937090, now seen corresponding path program 1 times [2024-10-14 18:08:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316470526] [2024-10-14 18:08:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316470526] [2024-10-14 18:08:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316470526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244297549] [2024-10-14 18:08:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:26,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:26,836 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-10-14 18:08:26,839 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-10-14 18:08:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:26,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 18:08:26,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:26,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:26,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:26,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:08:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:08:27,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:27,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 18:08:27,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:27,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 18:08:27,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:27,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:27,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:27,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:27,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:27,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-14 18:08:27,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 246 [2024-10-14 18:08:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244297549] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:27,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-14 18:08:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777606613] [2024-10-14 18:08:27,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 18:08:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 18:08:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-10-14 18:08:27,881 INFO L87 Difference]: Start difference. First operand 151 states and 192 transitions. Second operand has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 18:08:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:28,319 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2024-10-14 18:08:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 18:08:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-10-14 18:08:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:28,321 INFO L225 Difference]: With dead ends: 158 [2024-10-14 18:08:28,321 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 18:08:28,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2024-10-14 18:08:28,322 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:28,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 610 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:08:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 18:08:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-10-14 18:08:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 141 states have internal predecessors, (175), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2024-10-14 18:08:28,328 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 33 [2024-10-14 18:08:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:28,328 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2024-10-14 18:08:28,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 18:08:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2024-10-14 18:08:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 18:08:28,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:28,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:28,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:08:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 18:08:28,534 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1749859558, now seen corresponding path program 1 times [2024-10-14 18:08:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:28,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129100379] [2024-10-14 18:08:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 18:08:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 18:08:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129100379] [2024-10-14 18:08:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129100379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066352759] [2024-10-14 18:08:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:28,966 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-10-14 18:08:28,968 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-10-14 18:08:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:29,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:08:29,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:29,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:29,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:29,235 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:29,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:08:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:08:29,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-14 18:08:29,298 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:08:29,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:08:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-10-14 18:08:29,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:29,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066352759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:29,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:29,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2024-10-14 18:08:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774809693] [2024-10-14 18:08:29,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:29,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 18:08:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 18:08:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=407, Unknown=1, NotChecked=40, Total=506 [2024-10-14 18:08:29,348 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 18:08:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:29,637 INFO L93 Difference]: Finished difference Result 153 states and 193 transitions. [2024-10-14 18:08:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:08:29,637 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 35 [2024-10-14 18:08:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:29,638 INFO L225 Difference]: With dead ends: 153 [2024-10-14 18:08:29,638 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 18:08:29,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=611, Unknown=1, NotChecked=50, Total=756 [2024-10-14 18:08:29,640 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:29,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 389 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2024-10-14 18:08:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 18:08:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-14 18:08:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 140 states have internal predecessors, (173), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 193 transitions. [2024-10-14 18:08:29,644 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 193 transitions. Word has length 35 [2024-10-14 18:08:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:29,645 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 193 transitions. [2024-10-14 18:08:29,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 18:08:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 193 transitions. [2024-10-14 18:08:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 18:08:29,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:29,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:29,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:29,850 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,SelfDestructingSolverStorable26 [2024-10-14 18:08:29,851 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:29,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1749859559, now seen corresponding path program 1 times [2024-10-14 18:08:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047978377] [2024-10-14 18:08:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 18:08:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:08:30,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047978377] [2024-10-14 18:08:30,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047978377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361531598] [2024-10-14 18:08:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:30,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:30,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:30,511 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-10-14 18:08:30,512 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-10-14 18:08:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:30,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 18:08:30,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:30,770 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:30,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:30,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:30,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:08:30,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-10-14 18:08:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:08:30,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 18:08:30,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:08:30,948 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-14 18:08:30,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:30,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:08:30,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:30,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-14 18:08:30,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:31,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361531598] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:31,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:31,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2024-10-14 18:08:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086174002] [2024-10-14 18:08:31,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:31,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:08:31,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:08:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-10-14 18:08:31,080 INFO L87 Difference]: Start difference. First operand 153 states and 193 transitions. Second operand has 26 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 18:08:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:31,618 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2024-10-14 18:08:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:08:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 35 [2024-10-14 18:08:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:31,620 INFO L225 Difference]: With dead ends: 150 [2024-10-14 18:08:31,620 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 18:08:31,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=990, Unknown=1, NotChecked=64, Total=1190 [2024-10-14 18:08:31,621 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:31,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 593 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 603 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2024-10-14 18:08:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 18:08:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-14 18:08:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 137 states have internal predecessors, (167), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2024-10-14 18:08:31,632 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 35 [2024-10-14 18:08:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:31,633 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2024-10-14 18:08:31,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 18:08:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2024-10-14 18:08:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:08:31,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:31,634 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:31,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:08:31,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 18:08:31,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash -259857978, now seen corresponding path program 1 times [2024-10-14 18:08:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583862818] [2024-10-14 18:08:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:08:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583862818] [2024-10-14 18:08:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583862818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781744015] [2024-10-14 18:08:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:32,527 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:08:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:32,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-14 18:08:32,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:32,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:32,890 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:08:32,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:08:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:33,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:33,145 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 26 treesize of output 19 [2024-10-14 18:08:33,166 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-14 18:08:33,167 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 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-14 18:08:33,267 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 34 treesize of output 25 [2024-10-14 18:08:33,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:33,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-14 18:08:33,640 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 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-14 18:08:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:33,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781744015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:34,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2024-10-14 18:08:34,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669399113] [2024-10-14 18:08:34,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:34,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 18:08:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 18:08:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 18:08:34,025 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 41 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:35,072 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2024-10-14 18:08:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 18:08:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 18:08:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:35,073 INFO L225 Difference]: With dead ends: 163 [2024-10-14 18:08:35,073 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 18:08:35,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=3298, Unknown=0, NotChecked=0, Total=3540 [2024-10-14 18:08:35,075 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:35,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 774 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:08:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 18:08:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2024-10-14 18:08:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 133 states have (on average 1.300751879699248) internal successors, (173), 141 states have internal predecessors, (173), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2024-10-14 18:08:35,080 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 34 [2024-10-14 18:08:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:35,081 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2024-10-14 18:08:35,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2024-10-14 18:08:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:08:35,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:35,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:35,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:35,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:35,282 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash -259857977, now seen corresponding path program 1 times [2024-10-14 18:08:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831672653] [2024-10-14 18:08:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:08:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831672653] [2024-10-14 18:08:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831672653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451084089] [2024-10-14 18:08:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:36,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:36,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:36,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:08:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:36,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-14 18:08:36,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:36,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:08:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:36,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:36,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:36,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:36,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:08:36,682 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:08:36,682 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:08:36,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:08:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:36,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:36,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-14 18:08:36,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:36,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:37,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:37,292 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))))) is different from false [2024-10-14 18:08:37,301 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))))) is different from false [2024-10-14 18:08:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451084089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:37,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2024-10-14 18:08:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825712905] [2024-10-14 18:08:37,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:37,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 18:08:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:37,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 18:08:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1774, Unknown=2, NotChecked=170, Total=2070 [2024-10-14 18:08:37,456 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:38,593 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2024-10-14 18:08:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:08:38,594 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 18:08:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:38,595 INFO L225 Difference]: With dead ends: 157 [2024-10-14 18:08:38,595 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 18:08:38,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=2777, Unknown=2, NotChecked=214, Total=3192 [2024-10-14 18:08:38,597 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:38,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 908 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:08:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 18:08:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-10-14 18:08:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.291044776119403) internal successors, (173), 142 states have internal predecessors, (173), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2024-10-14 18:08:38,602 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 34 [2024-10-14 18:08:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:38,603 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2024-10-14 18:08:38,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 32 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2024-10-14 18:08:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 18:08:38,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:38,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:38,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:08:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:38,805 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1682461077, now seen corresponding path program 1 times [2024-10-14 18:08:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817641223] [2024-10-14 18:08:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:39,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:39,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817641223] [2024-10-14 18:08:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817641223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959374725] [2024-10-14 18:08:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:39,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:39,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:08:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:39,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 18:08:39,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:39,494 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:08:39,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-14 18:08:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:39,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959374725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:40,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 23 [2024-10-14 18:08:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201688046] [2024-10-14 18:08:40,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:40,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 18:08:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 18:08:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-10-14 18:08:40,100 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:08:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:40,533 INFO L93 Difference]: Finished difference Result 164 states and 201 transitions. [2024-10-14 18:08:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 18:08:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-14 18:08:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:40,535 INFO L225 Difference]: With dead ends: 164 [2024-10-14 18:08:40,535 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 18:08:40,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-10-14 18:08:40,536 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:40,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 362 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:08:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 18:08:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-14 18:08:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 135 states have internal predecessors, (165), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 185 transitions. [2024-10-14 18:08:40,540 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 185 transitions. Word has length 34 [2024-10-14 18:08:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:40,540 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 185 transitions. [2024-10-14 18:08:40,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:08:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2024-10-14 18:08:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 18:08:40,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:40,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:40,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:40,746 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -615348344, now seen corresponding path program 1 times [2024-10-14 18:08:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433961509] [2024-10-14 18:08:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:08:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433961509] [2024-10-14 18:08:41,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433961509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:41,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301522051] [2024-10-14 18:08:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:41,231 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:41,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 18:08:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:41,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 18:08:41,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:41,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:41,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-14 18:08:41,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:41,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:08:41,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:41,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-14 18:08:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:41,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301522051] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:42,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 31 [2024-10-14 18:08:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059433690] [2024-10-14 18:08:42,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:42,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 18:08:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 18:08:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1151, Unknown=23, NotChecked=0, Total=1260 [2024-10-14 18:08:42,169 INFO L87 Difference]: Start difference. First operand 148 states and 185 transitions. Second operand has 32 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:42,959 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2024-10-14 18:08:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:08:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-10-14 18:08:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:42,961 INFO L225 Difference]: With dead ends: 151 [2024-10-14 18:08:42,961 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 18:08:42,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=2164, Unknown=24, NotChecked=0, Total=2352 [2024-10-14 18:08:42,962 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:42,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 981 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:08:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 18:08:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-10-14 18:08:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.296875) internal successors, (166), 136 states have internal predecessors, (166), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 18:08:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 186 transitions. [2024-10-14 18:08:42,967 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 186 transitions. Word has length 36 [2024-10-14 18:08:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 186 transitions. [2024-10-14 18:08:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 186 transitions. [2024-10-14 18:08:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:08:42,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:42,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:42,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:43,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:43,173 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1878204428, now seen corresponding path program 2 times [2024-10-14 18:08:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98125068] [2024-10-14 18:08:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:08:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:08:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:08:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98125068] [2024-10-14 18:08:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98125068] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123389092] [2024-10-14 18:08:43,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:08:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:43,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:43,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-14 18:08:43,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:08:43,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:08:43,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-14 18:08:43,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:43,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:43,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:44,081 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:08:44,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:08:44,092 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 12 treesize of output 14 [2024-10-14 18:08:44,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:44,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:08:44,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-14 18:08:44,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:08:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:44,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:08:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2024-10-14 18:08:44,356 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 18:08:44,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-14 18:08:44,697 INFO L349 Elim1Store]: treesize reduction 36, result has 43.8 percent of original size [2024-10-14 18:08:44,697 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 3 case distinctions, treesize of input 24 treesize of output 37 [2024-10-14 18:08:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:45,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123389092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:45,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 35 [2024-10-14 18:08:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474482387] [2024-10-14 18:08:45,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:45,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 18:08:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 18:08:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 18:08:45,475 INFO L87 Difference]: Start difference. First operand 149 states and 186 transitions. Second operand has 36 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 7 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 18:08:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:46,361 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2024-10-14 18:08:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:08:46,362 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 7 states have call successors, (8), 4 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-10-14 18:08:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:46,363 INFO L225 Difference]: With dead ends: 153 [2024-10-14 18:08:46,363 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 18:08:46,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 18:08:46,365 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:46,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 701 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:08:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 18:08:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2024-10-14 18:08:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 116 states have internal predecessors, (138), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 18:08:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2024-10-14 18:08:46,369 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 37 [2024-10-14 18:08:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2024-10-14 18:08:46,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 7 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 18:08:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2024-10-14 18:08:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 18:08:46,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:46,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:46,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:46,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:46,574 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -147812386, now seen corresponding path program 1 times [2024-10-14 18:08:46,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928628127] [2024-10-14 18:08:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928628127] [2024-10-14 18:08:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928628127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962455036] [2024-10-14 18:08:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:47,665 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:47,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-14 18:08:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:47,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-14 18:08:47,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:47,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:47,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:48,098 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:08:48,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 18:08:48,114 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:08:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:08:48,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:48,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:48,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:08:48,288 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:08:48,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:08:52,304 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) is different from false [2024-10-14 18:08:52,306 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) is different from true [2024-10-14 18:08:52,317 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 23 treesize of output 11 [2024-10-14 18:08:52,325 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 16 treesize of output 11 [2024-10-14 18:08:52,430 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-10-14 18:08:52,430 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 48 treesize of output 52 [2024-10-14 18:08:52,436 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 20 treesize of output 11 [2024-10-14 18:08:52,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-14 18:08:52,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:52,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:52,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:52,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:52,670 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2170 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2170) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-10-14 18:08:52,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~now~1#1.offset|))) (and (forall ((v_ArrVal_2171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2171) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2170 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2170) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)))) is different from false [2024-10-14 18:08:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962455036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:52,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2024-10-14 18:08:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502015524] [2024-10-14 18:08:52,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 18:08:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 18:08:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1365, Unknown=22, NotChecked=228, Total=1722 [2024-10-14 18:08:52,973 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 37 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:53,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (= (select .cse3 0) 0)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse1 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) .cse1 (= (select .cse3 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse0 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~shared~0#1.base|) 1)))) is different from false [2024-10-14 18:08:53,553 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (= (select .cse3 0) 0)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse1 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) .cse1 (= (select .cse3 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse0 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~shared~0#1.base|) 1)))) is different from true [2024-10-14 18:08:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:54,014 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2024-10-14 18:08:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:08:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2024-10-14 18:08:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:54,015 INFO L225 Difference]: With dead ends: 142 [2024-10-14 18:08:54,015 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 18:08:54,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=188, Invalid=2351, Unknown=27, NotChecked=404, Total=2970 [2024-10-14 18:08:54,017 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:54,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 638 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 968 Invalid, 0 Unknown, 116 Unchecked, 0.6s Time] [2024-10-14 18:08:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 18:08:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-14 18:08:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.256198347107438) internal successors, (152), 129 states have internal predecessors, (152), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 18:08:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 170 transitions. [2024-10-14 18:08:54,022 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 170 transitions. Word has length 37 [2024-10-14 18:08:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 170 transitions. [2024-10-14 18:08:54,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:08:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 170 transitions. [2024-10-14 18:08:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:08:54,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:54,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:54,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:54,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:54,225 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:54,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash -313826801, now seen corresponding path program 1 times [2024-10-14 18:08:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:54,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241939199] [2024-10-14 18:08:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 18:08:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 18:08:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:08:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241939199] [2024-10-14 18:08:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241939199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:54,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758174351] [2024-10-14 18:08:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:54,442 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:54,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-14 18:08:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:54,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:08:54,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:08:54,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:54,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:54,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-10-14 18:08:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:08:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758174351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:08:54,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:08:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2024-10-14 18:08:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43045384] [2024-10-14 18:08:54,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:08:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:08:54,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:08:54,850 INFO L87 Difference]: Start difference. First operand 141 states and 170 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:08:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:55,019 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2024-10-14 18:08:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:08:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-10-14 18:08:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:55,021 INFO L225 Difference]: With dead ends: 155 [2024-10-14 18:08:55,021 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 18:08:55,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:08:55,021 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:55,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 289 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:08:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 18:08:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2024-10-14 18:08:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 138 states have internal predecessors, (166), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 18:08:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2024-10-14 18:08:55,028 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 39 [2024-10-14 18:08:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:55,028 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2024-10-14 18:08:55,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:08:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2024-10-14 18:08:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:08:55,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:55,029 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:08:55,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:55,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-14 18:08:55,230 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash -921973961, now seen corresponding path program 2 times [2024-10-14 18:08:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851253654] [2024-10-14 18:08:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:08:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:08:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:08:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:08:56,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:08:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851253654] [2024-10-14 18:08:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851253654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094948100] [2024-10-14 18:08:56,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:08:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:08:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:08:56,217 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:08:56,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-14 18:08:56,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:08:56,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:08:56,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-14 18:08:56,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:08:56,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:08:56,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:56,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:08:56,578 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 18:08:56,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 18:08:56,635 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-10-14 18:08:56,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-14 18:08:56,931 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 18:08:56,931 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 20 treesize of output 22 [2024-10-14 18:08:57,098 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-14 18:08:57,098 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 47 treesize of output 42 [2024-10-14 18:08:57,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-14 18:08:57,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:57,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:08:57,538 INFO L349 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2024-10-14 18:08:57,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2024-10-14 18:08:57,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:08:57,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:08:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:08:57,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:08:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094948100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:08:58,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:08:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 41 [2024-10-14 18:08:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340605371] [2024-10-14 18:08:58,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:08:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 18:08:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:08:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 18:08:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2214, Unknown=2, NotChecked=0, Total=2352 [2024-10-14 18:08:58,056 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand has 41 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 33 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:08:59,399 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2024-10-14 18:08:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:08:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 33 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2024-10-14 18:08:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:08:59,401 INFO L225 Difference]: With dead ends: 154 [2024-10-14 18:08:59,401 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 18:08:59,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=3212, Unknown=2, NotChecked=0, Total=3422 [2024-10-14 18:08:59,402 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:08:59,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1036 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 18:08:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 18:08:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2024-10-14 18:08:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 140 states have internal predecessors, (168), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 18:08:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2024-10-14 18:08:59,407 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 39 [2024-10-14 18:08:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:08:59,407 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2024-10-14 18:08:59,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 33 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:08:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2024-10-14 18:08:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 18:08:59,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:08:59,408 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 18:08:59,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-14 18:08:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-14 18:08:59,609 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:08:59,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:08:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1253758169, now seen corresponding path program 1 times [2024-10-14 18:08:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:08:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475100879] [2024-10-14 18:08:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:08:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:08:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:08:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:09:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:09:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 18:09:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:09:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475100879] [2024-10-14 18:09:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475100879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425238821] [2024-10-14 18:09:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:09:00,158 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:09:00,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-14 18:09:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:00,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 18:09:00,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:09:00,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:00,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:09:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 18:09:00,608 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-10-14 18:09:00,608 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 20 treesize of output 22 [2024-10-14 18:09:00,665 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 17 treesize of output 12 [2024-10-14 18:09:00,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:00,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2024-10-14 18:09:00,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:09:00,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:09:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:09:00,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:09:00,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:09:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-10-14 18:09:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425238821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:01,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:09:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 35 [2024-10-14 18:09:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029696218] [2024-10-14 18:09:01,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:09:01,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 18:09:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:09:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 18:09:01,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1312, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 18:09:01,073 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 36 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:09:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:09:01,864 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2024-10-14 18:09:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 18:09:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2024-10-14 18:09:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:09:01,867 INFO L225 Difference]: With dead ends: 160 [2024-10-14 18:09:01,867 INFO L226 Difference]: Without dead ends: 160 [2024-10-14 18:09:01,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=2380, Unknown=0, NotChecked=0, Total=2550 [2024-10-14 18:09:01,868 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:09:01,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 861 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:09:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-14 18:09:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2024-10-14 18:09:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 140 states have internal predecessors, (168), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 18:09:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2024-10-14 18:09:01,877 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 41 [2024-10-14 18:09:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:09:01,877 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2024-10-14 18:09:01,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:09:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2024-10-14 18:09:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:09:01,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:09:01,878 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 18:09:01,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-14 18:09:02,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-14 18:09:02,080 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:09:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:09:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1311723502, now seen corresponding path program 3 times [2024-10-14 18:09:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:09:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669206307] [2024-10-14 18:09:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:09:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:09:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:09:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:09:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:09:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:09:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669206307] [2024-10-14 18:09:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669206307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086853803] [2024-10-14 18:09:03,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 18:09:03,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:03,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:09:03,402 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:09:03,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-14 18:09:03,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 18:09:03,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:09:03,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-14 18:09:03,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:09:03,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:03,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:09:03,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:09:03,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:09:03,978 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_75 Int)) (and (= |c_#valid| (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_75 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_75))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_75) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| v_alloc_and_zero_internal_~pi~1.base_75 (select |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_75))))) is different from true [2024-10-14 18:09:03,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:03,983 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 24 treesize of output 17 [2024-10-14 18:09:03,996 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:09:03,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 18:09:04,008 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:09:04,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:09:04,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:09:04,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-10-14 18:09:04,225 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-14 18:09:04,225 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 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-14 18:09:04,323 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 34 treesize of output 25 [2024-10-14 18:09:04,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-14 18:09:04,589 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 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-14 18:09:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:09:04,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:09:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086853803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:05,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:09:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2024-10-14 18:09:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197448616] [2024-10-14 18:09:05,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:09:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 18:09:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:09:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 18:09:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3116, Unknown=3, NotChecked=112, Total=3422 [2024-10-14 18:09:05,008 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 52 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 7 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 18:09:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:09:06,325 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2024-10-14 18:09:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:09:06,330 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 7 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 42 [2024-10-14 18:09:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:09:06,331 INFO L225 Difference]: With dead ends: 181 [2024-10-14 18:09:06,331 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 18:09:06,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=285, Invalid=4546, Unknown=3, NotChecked=136, Total=4970 [2024-10-14 18:09:06,333 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:09:06,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1078 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1758 Invalid, 0 Unknown, 103 Unchecked, 0.9s Time] [2024-10-14 18:09:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 18:09:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2024-10-14 18:09:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 157 states have internal predecessors, (189), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 18:09:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2024-10-14 18:09:06,339 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 42 [2024-10-14 18:09:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:09:06,339 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2024-10-14 18:09:06,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 7 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 18:09:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2024-10-14 18:09:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:09:06,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:09:06,341 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 18:09:06,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-14 18:09:06,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:06,542 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-14 18:09:06,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:09:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1311723501, now seen corresponding path program 2 times [2024-10-14 18:09:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:09:06,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214806421] [2024-10-14 18:09:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:09:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:09:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:09:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 18:09:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:09:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:09:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:09:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:09:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:09:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214806421] [2024-10-14 18:09:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214806421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:09:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920319996] [2024-10-14 18:09:07,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:09:07,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:09:07,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:09:07,779 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:09:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-14 18:09:07,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:09:07,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:09:07,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-10-14 18:09:07,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:09:07,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:08,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:09:08,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:09:08,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:09:08,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:09:08,231 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