./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/dll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-shared.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 39ed728cb409795523ff80ba60708f74ca221f895fcd408de5b511302ce35f8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:07:28,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:07:28,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 18:07:28,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:07:28,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:07:28,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:07:28,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:07:28,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:07:28,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:07:28,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:07:28,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:07:28,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:07:28,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:07:28,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:07:28,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:07:28,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:07:28,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:07:28,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:07:28,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:07:28,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:07:28,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:07:28,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:07:28,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:07:28,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:07:28,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:07:28,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:07:28,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:07:28,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:07:28,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:07:28,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:07:28,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:28,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:07:28,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:07:28,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:07:28,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:07:28,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:07:28,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:07:28,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:07:28,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:07:28,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39ed728cb409795523ff80ba60708f74ca221f895fcd408de5b511302ce35f8c [2024-10-11 18:07:29,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:07:29,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:07:29,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:07:29,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:07:29,274 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:07:29,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-shared.i [2024-10-11 18:07:30,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:07:31,085 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:07:31,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-fst-shared.i [2024-10-11 18:07:31,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b90d347f/75e0b5c4214843c592c0441ad3643778/FLAGd02efc531 [2024-10-11 18:07:31,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b90d347f/75e0b5c4214843c592c0441ad3643778 [2024-10-11 18:07:31,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:07:31,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:07:31,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:31,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:07:31,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:07:31,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a4ff08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31, skipping insertion in model container [2024-10-11 18:07:31,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:07:31,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:31,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:07:31,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:31,697 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:07:31,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31 WrapperNode [2024-10-11 18:07:31,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:31,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:31,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:07:31,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:07:31,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,745 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-10-11 18:07:31,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:31,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:07:31,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:07:31,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:07:31,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,787 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 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-11 18:07:31,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:07:31,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:07:31,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:07:31,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:07:31,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (1/1) ... [2024-10-11 18:07:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:31,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:31,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:07:31,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:07:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:07:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:07:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:07:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:07:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:07:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:07:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:07:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:07:31,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:07:31,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:07:31,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:07:32,262 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-10-11 18:07:32,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:07:32,339 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:07:32,339 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:07:32,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:32 BoogieIcfgContainer [2024-10-11 18:07:32,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:07:32,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:07:32,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:07:32,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:07:32,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:07:31" (1/3) ... [2024-10-11 18:07:32,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f512c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:32, skipping insertion in model container [2024-10-11 18:07:32,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:31" (2/3) ... [2024-10-11 18:07:32,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f512c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:32, skipping insertion in model container [2024-10-11 18:07:32,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:32" (3/3) ... [2024-10-11 18:07:32,352 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-fst-shared.i [2024-10-11 18:07:32,366 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:07:32,366 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-11 18:07:32,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:07:32,410 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;@241214c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:07:32,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-10-11 18:07:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:32,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:32,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:32,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 5153845, now seen corresponding path program 1 times [2024-10-11 18:07:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205104950] [2024-10-11 18:07:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205104950] [2024-10-11 18:07:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205104950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872535025] [2024-10-11 18:07:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:32,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:32,745 INFO L87 Difference]: Start difference. First operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:32,832 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-11 18:07:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:32,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:32,846 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:32,847 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:07:32,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:32,852 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:32,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:07:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 18:07:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 32 states have (on average 2.125) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-11 18:07:32,888 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 4 [2024-10-11 18:07:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-11 18:07:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-11 18:07:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:32,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:32,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:32,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:07:32,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 5153846, now seen corresponding path program 1 times [2024-10-11 18:07:32,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:32,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450882998] [2024-10-11 18:07:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:33,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450882998] [2024-10-11 18:07:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450882998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703681509] [2024-10-11 18:07:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:33,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:33,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:33,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:33,017 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:33,119 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-11 18:07:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:33,122 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:07:33,124 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:07:33,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:33,126 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:33,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:07:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 18:07:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.0625) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-11 18:07:33,141 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 4 [2024-10-11 18:07:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-11 18:07:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-11 18:07:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:33,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:33,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:07:33,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:33,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash 863364339, now seen corresponding path program 1 times [2024-10-11 18:07:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409838036] [2024-10-11 18:07:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409838036] [2024-10-11 18:07:33,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409838036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:33,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39994202] [2024-10-11 18:07:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:33,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:33,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:33,395 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:33,524 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-10-11 18:07:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 18:07:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:33,527 INFO L225 Difference]: With dead ends: 69 [2024-10-11 18:07:33,527 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 18:07:33,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:33,532 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:33,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 111 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 18:07:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-11 18:07:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 2.03125) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-10-11 18:07:33,548 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2024-10-11 18:07:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:33,549 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-10-11 18:07:33,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-10-11 18:07:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:33,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:33,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:07:33,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 863364338, now seen corresponding path program 1 times [2024-10-11 18:07:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400038105] [2024-10-11 18:07:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400038105] [2024-10-11 18:07:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400038105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466580852] [2024-10-11 18:07:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:33,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:33,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:33,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:33,692 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:33,818 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-11 18:07:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-11 18:07:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:33,820 INFO L225 Difference]: With dead ends: 68 [2024-10-11 18:07:33,820 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 18:07:33,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:33,821 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:33,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 18:07:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-11 18:07:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-11 18:07:33,833 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 8 [2024-10-11 18:07:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:33,834 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-11 18:07:33,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-11 18:07:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:33,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:33,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:33,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:07:33,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:33,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 994494627, now seen corresponding path program 1 times [2024-10-11 18:07:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908648397] [2024-10-11 18:07:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908648397] [2024-10-11 18:07:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908648397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:34,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:34,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25839294] [2024-10-11 18:07:34,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:34,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:34,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:34,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:34,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:34,089 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:34,250 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-11 18:07:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:34,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:34,251 INFO L225 Difference]: With dead ends: 64 [2024-10-11 18:07:34,252 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 18:07:34,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:34,254 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:34,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 165 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 18:07:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-11 18:07:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:07:34,261 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 9 [2024-10-11 18:07:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:34,262 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:07:34,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:07:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:34,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:34,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:34,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:07:34,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 994494628, now seen corresponding path program 1 times [2024-10-11 18:07:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851595732] [2024-10-11 18:07:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851595732] [2024-10-11 18:07:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851595732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374435292] [2024-10-11 18:07:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:34,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:34,664 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:34,832 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-11 18:07:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 18:07:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:34,834 INFO L225 Difference]: With dead ends: 63 [2024-10-11 18:07:34,834 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 18:07:34,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:34,835 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:34,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 18:07:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-11 18:07:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-11 18:07:34,847 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 9 [2024-10-11 18:07:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:34,848 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-11 18:07:34,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-11 18:07:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:34,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:34,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:07:34,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816035, now seen corresponding path program 1 times [2024-10-11 18:07:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008441420] [2024-10-11 18:07:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008441420] [2024-10-11 18:07:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008441420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662125007] [2024-10-11 18:07:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:34,987 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:35,140 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-10-11 18:07:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:35,142 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:35,142 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:35,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:35,143 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:35,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2024-10-11 18:07:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 68 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2024-10-11 18:07:35,154 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 14 [2024-10-11 18:07:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:35,154 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2024-10-11 18:07:35,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2024-10-11 18:07:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:07:35,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:35,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:35,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:07:35,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:35,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816036, now seen corresponding path program 1 times [2024-10-11 18:07:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728757914] [2024-10-11 18:07:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728757914] [2024-10-11 18:07:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728757914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152127861] [2024-10-11 18:07:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:35,460 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:35,630 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2024-10-11 18:07:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 18:07:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:35,632 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:35,632 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:35,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:35,633 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:35,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 283 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-10-11 18:07:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 72 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-11 18:07:35,645 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 14 [2024-10-11 18:07:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:35,645 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-11 18:07:35,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-11 18:07:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:07:35,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:35,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:35,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:07:35,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:35,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439037, now seen corresponding path program 1 times [2024-10-11 18:07:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789307189] [2024-10-11 18:07:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789307189] [2024-10-11 18:07:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789307189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:07:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889724214] [2024-10-11 18:07:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:07:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:07:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:07:35,736 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:35,852 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-10-11 18:07:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:07:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:07:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:35,854 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:35,854 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:35,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:35,855 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:35,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:07:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 78 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2024-10-11 18:07:35,870 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 15 [2024-10-11 18:07:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2024-10-11 18:07:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2024-10-11 18:07:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:07:35,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:35,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:35,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:07:35,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:35,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439036, now seen corresponding path program 1 times [2024-10-11 18:07:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947912871] [2024-10-11 18:07:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947912871] [2024-10-11 18:07:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947912871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333214012] [2024-10-11 18:07:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:36,086 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,255 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-10-11 18:07:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 18:07:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,257 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:36,257 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:36,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:36,269 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 287 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:07:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-10-11 18:07:36,278 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 15 [2024-10-11 18:07:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,279 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-10-11 18:07:36,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-10-11 18:07:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:36,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:07:36,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1287019437, now seen corresponding path program 1 times [2024-10-11 18:07:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446526885] [2024-10-11 18:07:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446526885] [2024-10-11 18:07:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446526885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874146168] [2024-10-11 18:07:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:36,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:36,400 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,500 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-10-11 18:07:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 18:07:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,502 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:36,502 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:36,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:36,503 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-11 18:07:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 78 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2024-10-11 18:07:36,511 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 16 [2024-10-11 18:07:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,512 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2024-10-11 18:07:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2024-10-11 18:07:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:07:36,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:07:36,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 239755371, now seen corresponding path program 1 times [2024-10-11 18:07:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104273422] [2024-10-11 18:07:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:36,710 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-11 18:07:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104273422] [2024-10-11 18:07:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104273422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119364407] [2024-10-11 18:07:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:36,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:36,713 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:36,857 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-10-11 18:07:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:07:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2024-10-11 18:07:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:36,858 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:07:36,858 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:07:36,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:36,859 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:36,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:07:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:07:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 78 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2024-10-11 18:07:36,865 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 17 [2024-10-11 18:07:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:36,865 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2024-10-11 18:07:36,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2024-10-11 18:07:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:07:36,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:36,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:36,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:07:36,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:36,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash 239755372, now seen corresponding path program 1 times [2024-10-11 18:07:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846995909] [2024-10-11 18:07:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,224 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-11 18:07:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:37,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846995909] [2024-10-11 18:07:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846995909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:37,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744169196] [2024-10-11 18:07:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:37,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:37,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:37,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:07:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:37,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:07:37,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:37,535 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-11 18:07:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:37,624 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-11 18:07:37,639 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:37,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:37,662 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-11 18:07:37,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744169196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:37,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:37,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-10-11 18:07:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067433982] [2024-10-11 18:07:37,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:37,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:07:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:07:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=318, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:07:37,843 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:38,160 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-10-11 18:07:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 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 17 [2024-10-11 18:07:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:38,162 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:07:38,162 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:07:38,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=389, Unknown=1, NotChecked=40, Total=506 [2024-10-11 18:07:38,163 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:38,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 358 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 305 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-10-11 18:07:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:07:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-10-11 18:07:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.690909090909091) internal successors, (93), 78 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2024-10-11 18:07:38,167 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 17 [2024-10-11 18:07:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2024-10-11 18:07:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:07:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2024-10-11 18:07:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:38,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:38,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:07:38,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:07:38,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:38,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 237319682, now seen corresponding path program 1 times [2024-10-11 18:07:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225809555] [2024-10-11 18:07:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225809555] [2024-10-11 18:07:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225809555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002259653] [2024-10-11 18:07:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:38,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:38,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:07:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 18:07:39,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:39,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:07:39,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:39,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:07:39,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:07:39,094 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-11 18:07:39,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:39,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:39,273 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-11 18:07:39,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 18:07:39,340 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-10-11 18:07:39,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:07:39,360 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 18:07:39,361 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 1 case distinctions, treesize of input 27 treesize of output 17 [2024-10-11 18:07:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:39,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:40,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_loop_~node~0#1.offset_17| Int) (v_ArrVal_610 (Array Int Int))) (or (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~node~0#1.offset_17|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_17| 0) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_610))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|) |v_ULTIMATE.start_loop_~node~0#1.offset_17|) 0))) (forall ((v_ArrVal_611 (Array Int Int)) (|v_ULTIMATE.start_loop_~node~0#1.offset_17| Int) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (or (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~node~0#1.offset_17|) (< |v_ULTIMATE.start_loop_~node~0#1.offset_17| 0) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_611))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) |v_ULTIMATE.start_loop_~node~0#1.offset_17|) 0))))) is different from false [2024-10-11 18:07:40,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:40,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-11 18:07:40,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:40,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:40,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-10-11 18:07:40,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-11 18:07:40,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:40,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-11 18:07:40,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:40,767 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:40,767 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 16 treesize of output 11 [2024-10-11 18:07:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002259653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:44,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:44,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 26 [2024-10-11 18:07:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297734340] [2024-10-11 18:07:44,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:44,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:07:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:07:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=534, Unknown=3, NotChecked=46, Total=650 [2024-10-11 18:07:44,069 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:48,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:07:52,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:07:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:52,899 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-10-11 18:07:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-10-11 18:07:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:52,900 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:07:52,900 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:07:52,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=98, Invalid=773, Unknown=3, NotChecked=56, Total=930 [2024-10-11 18:07:52,901 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:52,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 626 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 461 Invalid, 2 Unknown, 34 Unchecked, 8.5s Time] [2024-10-11 18:07:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:07:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 18:07:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 76 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-10-11 18:07:52,906 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 18 [2024-10-11 18:07:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-10-11 18:07:52,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-10-11 18:07:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:52,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:52,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:52,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:53,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:53,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227119, now seen corresponding path program 1 times [2024-10-11 18:07:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311308587] [2024-10-11 18:07:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,281 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-11 18:07:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:53,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311308587] [2024-10-11 18:07:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311308587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:53,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055939007] [2024-10-11 18:07:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:53,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:53,284 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11 18:07:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:53,449 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2024-10-11 18:07:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2024-10-11 18:07:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:53,451 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:07:53,451 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:07:53,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:53,452 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:53,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 197 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:07:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 18:07:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-10-11 18:07:53,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 19 [2024-10-11 18:07:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:53,457 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-10-11 18:07:53,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11 18:07:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-10-11 18:07:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:53,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:53,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:53,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:07:53,459 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:53,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227118, now seen corresponding path program 1 times [2024-10-11 18:07:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380398035] [2024-10-11 18:07:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:53,756 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-11 18:07:53,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:53,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380398035] [2024-10-11 18:07:53,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380398035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:53,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:53,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:53,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119324750] [2024-10-11 18:07:53,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:53,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:53,759 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 18:07:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:53,921 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-10-11 18:07:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:53,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2024-10-11 18:07:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:53,922 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:07:53,922 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 18:07:53,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:53,923 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:53,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 18:07:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 18:07:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 74 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-10-11 18:07:53,929 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 19 [2024-10-11 18:07:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:53,930 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-10-11 18:07:53,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 18:07:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-10-11 18:07:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:53,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:53,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:53,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:07:53,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:53,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139404, now seen corresponding path program 1 times [2024-10-11 18:07:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:53,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251881286] [2024-10-11 18:07:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,011 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-11 18:07:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251881286] [2024-10-11 18:07:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251881286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112002252] [2024-10-11 18:07:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:54,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:54,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:07:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:07:54,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:54,148 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-11 18:07:54,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:54,163 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:07:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-10-11 18:07:54,172 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-11 18:07:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112002252] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:54,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-11 18:07:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16153828] [2024-10-11 18:07:54,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:54,176 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:54,333 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2024-10-11 18:07:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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 19 [2024-10-11 18:07:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:54,335 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:07:54,335 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:07:54,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:54,335 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:54,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 135 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:07:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-11 18:07:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2024-10-11 18:07:54,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 19 [2024-10-11 18:07:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:54,341 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2024-10-11 18:07:54,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2024-10-11 18:07:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:54,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:54,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:54,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:54,547 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139403, now seen corresponding path program 1 times [2024-10-11 18:07:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334101011] [2024-10-11 18:07:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,765 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-11 18:07:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334101011] [2024-10-11 18:07:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334101011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653580520] [2024-10-11 18:07:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:54,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:54,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:07:54,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:07:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:07:54,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:54,988 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-11 18:07:54,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:55,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:55,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 18:07:55,139 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-11 18:07:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653580520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:55,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-10-11 18:07:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598550410] [2024-10-11 18:07:55,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:07:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:07:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:07:55,142 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:55,425 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-10-11 18:07:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:07:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:55,427 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:07:55,427 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:07:55,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:07:55,428 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:55,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 303 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:07:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 18:07:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 76 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-10-11 18:07:55,432 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 19 [2024-10-11 18:07:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-10-11 18:07:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-10-11 18:07:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:07:55,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:55,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:55,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:07:55,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:07:55,637 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 427384198, now seen corresponding path program 1 times [2024-10-11 18:07:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:55,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768285454] [2024-10-11 18:07:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,947 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-11 18:07:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768285454] [2024-10-11 18:07:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768285454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498087822] [2024-10-11 18:07:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:55,949 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:56,168 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-10-11 18:07:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 18:07:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:56,169 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:07:56,169 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:07:56,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:07:56,170 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:56,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 285 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:07:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-10-11 18:07:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.5) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-10-11 18:07:56,174 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 20 [2024-10-11 18:07:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:56,174 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-10-11 18:07:56,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-10-11 18:07:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:56,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:56,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:56,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:07:56,175 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:56,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash 762676370, now seen corresponding path program 1 times [2024-10-11 18:07:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073586170] [2024-10-11 18:07:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,672 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-11 18:07:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073586170] [2024-10-11 18:07:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073586170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838107327] [2024-10-11 18:07:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:56,675 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-11 18:07:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:56,892 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-11 18:07:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-11 18:07:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:56,893 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:07:56,893 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:07:56,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:07:56,894 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:56,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 220 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:07:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-11 18:07:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 80 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-10-11 18:07:56,899 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 21 [2024-10-11 18:07:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:56,899 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-10-11 18:07:56,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-11 18:07:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-10-11 18:07:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:56,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:56,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:56,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:07:56,900 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash 762676369, now seen corresponding path program 1 times [2024-10-11 18:07:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:56,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825060525] [2024-10-11 18:07:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:07:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,174 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-11 18:07:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825060525] [2024-10-11 18:07:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825060525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277233161] [2024-10-11 18:07:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:57,177 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 12 states, 10 states have (on average 1.7) 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-11 18:07:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:57,419 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-10-11 18:07:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:57,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) 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-11 18:07:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:57,420 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:07:57,420 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:07:57,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:07:57,421 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:57,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 260 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:07:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:07:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.467741935483871) internal successors, (91), 80 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-10-11 18:07:57,425 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 21 [2024-10-11 18:07:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,426 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-10-11 18:07:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) 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-11 18:07:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-10-11 18:07:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:57,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,426 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-11 18:07:57,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:07:57,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 364353339, now seen corresponding path program 1 times [2024-10-11 18:07:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32946250] [2024-10-11 18:07:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,570 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-11 18:07:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32946250] [2024-10-11 18:07:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32946250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:07:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479186970] [2024-10-11 18:07:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:57,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:57,573 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:57,727 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-11 18:07:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:57,728 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 18:07:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:57,728 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:07:57,728 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:07:57,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:57,729 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:57,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:07:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-10-11 18:07:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-10-11 18:07:57,732 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 21 [2024-10-11 18:07:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,732 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-10-11 18:07:57,732 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-10-11 18:07:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:57,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,733 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-11 18:07:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:07:57,734 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 364008372, now seen corresponding path program 1 times [2024-10-11 18:07:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178494038] [2024-10-11 18:07:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,017 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-11 18:07:58,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178494038] [2024-10-11 18:07:58,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178494038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:58,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:58,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:58,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806197908] [2024-10-11 18:07:58,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:58,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:58,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:58,019 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:58,256 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-10-11 18:07:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 18:07:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:58,258 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:07:58,258 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:07:58,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:07:58,259 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:58,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 258 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:07:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-10-11 18:07:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-10-11 18:07:58,262 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 21 [2024-10-11 18:07:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:58,262 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-10-11 18:07:58,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-10-11 18:07:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:58,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:58,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:58,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:07:58,264 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1600642232, now seen corresponding path program 1 times [2024-10-11 18:07:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148039577] [2024-10-11 18:07:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,593 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-11 18:07:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148039577] [2024-10-11 18:07:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148039577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:58,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413672287] [2024-10-11 18:07:58,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:58,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:58,596 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:58,833 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-10-11 18:07:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 18:07:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:58,835 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:07:58,835 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:07:58,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:07:58,836 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:58,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 280 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:07:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:07:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.403225806451613) internal successors, (87), 80 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-10-11 18:07:58,841 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 22 [2024-10-11 18:07:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:58,841 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-10-11 18:07:58,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-10-11 18:07:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:07:58,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:58,842 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] [2024-10-11 18:07:58,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:07:58,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:58,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash -618888661, now seen corresponding path program 1 times [2024-10-11 18:07:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572474591] [2024-10-11 18:07:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,214 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-11 18:07:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572474591] [2024-10-11 18:07:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572474591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:07:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10416415] [2024-10-11 18:07:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:59,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:07:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:07:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:07:59,217 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:59,487 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-11 18:07:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 18:07:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:59,489 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:07:59,489 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:07:59,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:07:59,490 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:59,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 193 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:07:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-11 18:07:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.390625) internal successors, (89), 82 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-11 18:07:59,493 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 24 [2024-10-11 18:07:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:59,493 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-11 18:07:59,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-11 18:07:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:07:59,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:59,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:59,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:07:59,494 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:59,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2046483990, now seen corresponding path program 1 times [2024-10-11 18:07:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552751539] [2024-10-11 18:07:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,626 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-11 18:07:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552751539] [2024-10-11 18:07:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552751539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159001633] [2024-10-11 18:07:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:59,628 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:59,779 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-11 18:07:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:07:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:59,781 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:07:59,781 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:07:59,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:59,782 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:59,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 206 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:07:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 18:07:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:07:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-10-11 18:07:59,785 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 26 [2024-10-11 18:07:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:59,785 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-10-11 18:07:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-10-11 18:07:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:07:59,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:59,786 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] [2024-10-11 18:07:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:07:59,786 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:07:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -578546267, now seen corresponding path program 1 times [2024-10-11 18:07:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515680340] [2024-10-11 18:07:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,195 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-11 18:08:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515680340] [2024-10-11 18:08:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515680340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578687938] [2024-10-11 18:08:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:00,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:08:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:08:00,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:00,466 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-11 18:08:00,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:00,487 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-11 18:08:00,500 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:00,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:00,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578687938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:00,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2024-10-11 18:08:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257327484] [2024-10-11 18:08:00,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:00,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:08:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:00,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:08:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=429, Unknown=1, NotChecked=42, Total=552 [2024-10-11 18:08:00,795 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:01,047 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-11 18:08:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:08:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 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 27 [2024-10-11 18:08:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:01,048 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:08:01,048 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:08:01,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=514, Unknown=1, NotChecked=46, Total=650 [2024-10-11 18:08:01,049 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:01,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2024-10-11 18:08:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:08:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2024-10-11 18:08:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-10-11 18:08:01,057 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 27 [2024-10-11 18:08:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:01,057 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-10-11 18:08:01,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-10-11 18:08:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:08:01,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:01,059 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] [2024-10-11 18:08:01,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:08:01,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:08:01,260 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135946, now seen corresponding path program 1 times [2024-10-11 18:08:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:01,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762770986] [2024-10-11 18:08:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:08:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:08:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762770986] [2024-10-11 18:08:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762770986] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859899816] [2024-10-11 18:08:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:01,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:01,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:01,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:01,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:08:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:08:01,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:02,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:02,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:02,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:02,068 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:02,069 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-11 18:08:02,113 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:02,113 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-11 18:08:02,121 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-11 18:08:02,133 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-11 18:08:02,162 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:08:02,162 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-11 18:08:02,164 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-11 18:08:02,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859899816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:02,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2024-10-11 18:08:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279902516] [2024-10-11 18:08:02,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:08:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:08:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:08:02,214 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:08:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:02,456 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-10-11 18:08:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:08:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-10-11 18:08:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:02,461 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:08:02,461 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:08:02,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=600, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:08:02,462 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:02,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 297 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2024-10-11 18:08:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:08:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:08:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 81 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-10-11 18:08:02,466 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 30 [2024-10-11 18:08:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:02,467 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-10-11 18:08:02,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 18:08:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-10-11 18:08:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:08:02,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:02,468 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] [2024-10-11 18:08:02,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:08:02,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:08:02,670 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:02,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135947, now seen corresponding path program 1 times [2024-10-11 18:08:02,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:02,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687792997] [2024-10-11 18:08:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:08:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:08:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687792997] [2024-10-11 18:08:03,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687792997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917989005] [2024-10-11 18:08:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:03,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:03,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:08:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 18:08:03,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:03,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:03,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:03,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:03,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:03,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:03,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:03,845 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-11 18:08:03,850 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-11 18:08:03,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:03,934 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-11 18:08:03,944 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-11 18:08:03,957 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-11 18:08:03,966 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-11 18:08:04,037 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-11 18:08:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:04,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:08:04,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:04,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:04,084 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-11 18:08:04,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917989005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:04,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-10-11 18:08:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208217068] [2024-10-11 18:08:04,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:04,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 18:08:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 18:08:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=722, Unknown=1, NotChecked=54, Total=870 [2024-10-11 18:08:04,194 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:08:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:04,728 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-10-11 18:08:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2024-10-11 18:08:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:04,729 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:08:04,729 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:08:04,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1220, Unknown=1, NotChecked=72, Total=1482 [2024-10-11 18:08:04,730 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:04,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 372 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 469 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2024-10-11 18:08:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:08:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:08:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-10-11 18:08:04,733 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 30 [2024-10-11 18:08:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:04,734 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-10-11 18:08:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 21 states have internal predecessors, (40), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:08:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-10-11 18:08:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:08:04,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:04,735 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] [2024-10-11 18:08:04,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:08:04,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:08:04,936 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:04,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash 256364298, now seen corresponding path program 1 times [2024-10-11 18:08:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828757394] [2024-10-11 18:08:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828757394] [2024-10-11 18:08:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828757394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430506467] [2024-10-11 18:08:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:05,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:05,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:05,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:08:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:08:05,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:05,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:05,489 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-11 18:08:05,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:05,500 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-11 18:08:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:05,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:05,665 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 18:08:05,665 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 24 treesize of output 23 [2024-10-11 18:08:05,677 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-11 18:08:05,678 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 20 treesize of output 12 [2024-10-11 18:08:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430506467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:05,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 21 [2024-10-11 18:08:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460710118] [2024-10-11 18:08:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:05,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:08:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:08:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:08:05,796 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:06,245 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-10-11 18:08:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:08:06,246 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 18:08:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:06,247 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:08:06,247 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:08:06,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2024-10-11 18:08:06,248 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:06,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 396 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:08:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-11 18:08:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.294871794871795) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-10-11 18:08:06,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 29 [2024-10-11 18:08:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:06,252 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-10-11 18:08:06,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-10-11 18:08:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:08:06,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:06,253 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-11 18:08:06,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:06,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:06,454 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:06,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash -642642783, now seen corresponding path program 1 times [2024-10-11 18:08:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:06,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596056763] [2024-10-11 18:08:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:07,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596056763] [2024-10-11 18:08:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596056763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513809752] [2024-10-11 18:08:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:07,038 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:07,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:08:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:08:07,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:07,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:07,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:07,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-10-11 18:08:08,175 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_25| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_25|) 0) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_25| 0)))) is different from true [2024-10-11 18:08:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-10-11 18:08:08,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:08,348 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 32 treesize of output 28 [2024-10-11 18:08:08,360 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 60 treesize of output 52 [2024-10-11 18:08:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513809752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:17,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:17,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-10-11 18:08:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260121669] [2024-10-11 18:08:17,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:17,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:08:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:08:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=900, Unknown=3, NotChecked=60, Total=1056 [2024-10-11 18:08:17,145 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:18,087 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-11 18:08:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:08:18,088 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-11 18:08:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:18,089 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:08:18,089 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:08:18,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=149, Invalid=1334, Unknown=3, NotChecked=74, Total=1560 [2024-10-11 18:08:18,090 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:18,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 269 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 638 Invalid, 0 Unknown, 71 Unchecked, 0.5s Time] [2024-10-11 18:08:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:08:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:08:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 77 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-10-11 18:08:18,093 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 30 [2024-10-11 18:08:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-11 18:08:18,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:08:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2024-10-11 18:08:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:18,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:18,094 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] [2024-10-11 18:08:18,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:18,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:18,295 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522749, now seen corresponding path program 1 times [2024-10-11 18:08:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186707419] [2024-10-11 18:08:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186707419] [2024-10-11 18:08:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186707419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287152883] [2024-10-11 18:08:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:18,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:18,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:08:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:18,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 18:08:19,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:19,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:19,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:19,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:19,254 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:19,254 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 25 treesize of output 26 [2024-10-11 18:08:19,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:19,292 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-11 18:08:19,371 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-11 18:08:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:19,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:19,452 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-11 18:08:19,452 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 18 [2024-10-11 18:08:19,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:19,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-10-11 18:08:19,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:19,617 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 408 treesize of output 343 [2024-10-11 18:08:19,635 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 287 treesize of output 271 [2024-10-11 18:08:19,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:19,653 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 271 treesize of output 247 [2024-10-11 18:08:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287152883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:19,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-10-11 18:08:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826516127] [2024-10-11 18:08:19,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 18:08:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:19,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 18:08:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1200, Unknown=8, NotChecked=0, Total=1332 [2024-10-11 18:08:19,903 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 29 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:20,394 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2024-10-11 18:08:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 31 [2024-10-11 18:08:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:20,396 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:08:20,396 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:08:20,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1604, Unknown=8, NotChecked=0, Total=1806 [2024-10-11 18:08:20,397 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:20,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 537 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:08:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 18:08:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 81 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-10-11 18:08:20,401 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2024-10-11 18:08:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:20,401 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-10-11 18:08:20,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-10-11 18:08:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:20,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:20,402 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] [2024-10-11 18:08:20,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 18:08:20,603 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:20,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522748, now seen corresponding path program 1 times [2024-10-11 18:08:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477829989] [2024-10-11 18:08:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:21,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:21,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477829989] [2024-10-11 18:08:21,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477829989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:21,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053274820] [2024-10-11 18:08:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:21,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:21,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:21,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:08:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 18:08:21,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:21,606 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:21,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:21,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:21,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:21,737 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:21,737 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 56 treesize of output 51 [2024-10-11 18:08:21,743 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 39 treesize of output 24 [2024-10-11 18:08:21,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:21,832 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 56 treesize of output 51 [2024-10-11 18:08:21,837 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 39 treesize of output 24 [2024-10-11 18:08:21,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 18:08:21,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 18:08:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:21,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:22,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,190 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 70 treesize of output 74 [2024-10-11 18:08:22,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-11 18:08:22,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-11 18:08:22,429 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 54 treesize of output 46 [2024-10-11 18:08:22,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,441 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 166 treesize of output 161 [2024-10-11 18:08:22,450 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 56 treesize of output 54 [2024-10-11 18:08:22,455 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 54 treesize of output 50 [2024-10-11 18:08:22,463 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 74 treesize of output 68 [2024-10-11 18:08:22,527 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:08:22,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2024-10-11 18:08:22,535 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:08:22,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2024-10-11 18:08:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053274820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:22,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2024-10-11 18:08:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613275512] [2024-10-11 18:08:22,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:22,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:08:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:22,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:08:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1409, Unknown=11, NotChecked=0, Total=1560 [2024-10-11 18:08:22,693 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 31 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:23,213 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-10-11 18:08:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 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 31 [2024-10-11 18:08:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:23,215 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:08:23,215 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:08:23,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=1843, Unknown=11, NotChecked=0, Total=2070 [2024-10-11 18:08:23,216 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:23,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 651 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:08:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 18:08:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-11 18:08:23,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 31 [2024-10-11 18:08:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-11 18:08:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-11 18:08:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:08:23,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:23,221 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] [2024-10-11 18:08:23,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:08:23,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 18:08:23,426 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:23,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -657671097, now seen corresponding path program 1 times [2024-10-11 18:08:23,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:23,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977455135] [2024-10-11 18:08:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977455135] [2024-10-11 18:08:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977455135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032192929] [2024-10-11 18:08:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:23,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:23,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:23,826 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:23,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:08:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:24,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-11 18:08:24,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:24,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:24,177 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-11 18:08:24,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:24,261 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 15 treesize of output 7 [2024-10-11 18:08:24,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:24,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2024-10-11 18:08:24,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:24,371 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 33 treesize of output 32 [2024-10-11 18:08:24,447 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 24 treesize of output 12 [2024-10-11 18:08:24,466 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-11 18:08:24,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:24,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2501) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) 0))) is different from false [2024-10-11 18:08:24,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2499 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 8) v_ArrVal_2499)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) v_ArrVal_2501)) |c_ULTIMATE.start_create_~dll~0#1.base|) |c_ULTIMATE.start_create_~dll~0#1.offset|) 0))) is different from false [2024-10-11 18:08:24,595 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-10-11 18:08:24,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 97 [2024-10-11 18:08:24,625 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-10-11 18:08:24,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 86 treesize of output 91 [2024-10-11 18:08:24,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:24,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 130 [2024-10-11 18:08:24,658 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 74 treesize of output 70 [2024-10-11 18:08:24,693 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 6 treesize of output 4 [2024-10-11 18:08:24,707 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 6 treesize of output 4 [2024-10-11 18:08:24,783 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 6 treesize of output 4 [2024-10-11 18:08:24,815 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 6 treesize of output 4 [2024-10-11 18:08:24,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:24,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 18:08:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032192929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:24,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2024-10-11 18:08:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651560868] [2024-10-11 18:08:24,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:24,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:08:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:08:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=988, Unknown=11, NotChecked=130, Total=1260 [2024-10-11 18:08:24,972 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 31 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:25,353 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-10-11 18:08:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 26 states have internal predecessors, (53), 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 33 [2024-10-11 18:08:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:25,354 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:08:25,354 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:08:25,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1287, Unknown=11, NotChecked=150, Total=1640 [2024-10-11 18:08:25,356 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:25,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 600 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:08:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-11 18:08:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.318840579710145) internal successors, (91), 81 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-10-11 18:08:25,363 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 33 [2024-10-11 18:08:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:25,363 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-10-11 18:08:25,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-10-11 18:08:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:25,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:25,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:25,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:25,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:25,564 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1485700593, now seen corresponding path program 1 times [2024-10-11 18:08:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058405271] [2024-10-11 18:08:25,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 18:08:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:08:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058405271] [2024-10-11 18:08:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058405271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761409006] [2024-10-11 18:08:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:26,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:26,392 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:26,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:08:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:26,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 18:08:26,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:26,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:26,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:26,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:26,716 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:26,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:08:26,749 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:26,749 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-11 18:08:26,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:26,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:26,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:26,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:26,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:26,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:26,941 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:08:26,942 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 50 treesize of output 45 [2024-10-11 18:08:26,950 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-11 18:08:26,957 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-11 18:08:26,961 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-11 18:08:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:08:26,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:27,052 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2725 (Array Int Int)) (v_ArrVal_2724 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2725) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2724) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)))) (forall ((v_ArrVal_2725 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2725) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))))) is different from false [2024-10-11 18:08:27,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2725 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2725) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 16))) (forall ((v_ArrVal_2725 (Array Int Int)) (v_ArrVal_2724 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2725) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2724) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|)))))) is different from false [2024-10-11 18:08:27,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-10-11 18:08:27,076 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 26 [2024-10-11 18:08:27,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-11 18:08:27,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-11 18:08:27,127 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:27,129 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 27 treesize of output 19 [2024-10-11 18:08:27,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:27,133 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 20 treesize of output 12 [2024-10-11 18:08:27,392 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-11 18:08:27,393 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 20 treesize of output 19 [2024-10-11 18:08:27,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2719 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2719) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) is different from false [2024-10-11 18:08:27,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2718 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) v_ArrVal_2718) |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~0#1.base|))) is different from false [2024-10-11 18:08:27,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-11 18:08:27,496 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 33 treesize of output 25 [2024-10-11 18:08:27,499 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 6 treesize of output 4 [2024-10-11 18:08:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-10-11 18:08:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761409006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:27,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 43 [2024-10-11 18:08:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892275264] [2024-10-11 18:08:27,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:08:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:08:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1421, Unknown=14, NotChecked=316, Total=1892 [2024-10-11 18:08:27,567 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 44 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:08:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:28,102 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-10-11 18:08:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:08:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 34 [2024-10-11 18:08:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:28,102 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:08:28,103 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:08:28,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1939, Unknown=14, NotChecked=372, Total=2550 [2024-10-11 18:08:28,104 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:28,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 793 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 553 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2024-10-11 18:08:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:08:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:08:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 80 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:08:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-11 18:08:28,106 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 34 [2024-10-11 18:08:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:28,107 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-11 18:08:28,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:08:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-11 18:08:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:28,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:28,108 INFO L215 NwaCegarLoop]: trace histogram [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-11 18:08:28,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:28,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:28,308 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-11 18:08:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:28,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1199448066, now seen corresponding path program 2 times [2024-10-11 18:08:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:28,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608612712] [2024-10-11 18:08:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 18:08:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608612712] [2024-10-11 18:08:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608612712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208352630] [2024-10-11 18:08:29,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:08:29,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:29,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:29,293 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:08:29,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:08:29,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:08:29,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:08:29,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-11 18:08:29,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:29,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:08:29,583 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-11 18:08:29,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:08:29,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:29,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:29,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-10-11 18:08:29,674 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-11 18:08:29,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:29,777 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-10-11 18:08:29,778 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 104 treesize of output 73 [2024-10-11 18:08:29,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:29,795 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-10-11 18:08:29,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 61 treesize of output 43 [2024-10-11 18:08:29,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:29,871 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-10-11 18:08:29,872 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 93 treesize of output 66 [2024-10-11 18:08:29,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:29,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2024-10-11 18:08:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:30,066 INFO L311 TraceCheckSpWp]: Computing backward predicates...