./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:02:41,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:02:41,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:02:41,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:02:41,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:02:41,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:02:41,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:02:41,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:02:41,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:02:41,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:02:41,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:02:41,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:02:41,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:02:41,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:02:41,725 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:02:41,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:02:41,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:02:41,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:02:41,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:02:41,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:02:41,727 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:02:41,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:02:41,730 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:02:41,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:02:41,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:02:41,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:02:41,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:02:41,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:02:41,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:02:41,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:02:41,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:02:41,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:02:41,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:02:41,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:02:41,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:02:41,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:02:41,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:02:41,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:02:41,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:02:41,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:02:41,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:02:41,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:02:41,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2024-10-13 11:02:42,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:02:42,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:02:42,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:02:42,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:02:42,031 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:02:42,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-10-13 11:02:43,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:02:43,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:02:43,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2024-10-13 11:02:43,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec32cc58f/78769498effa48f7931f40d74b2e9cb5/FLAGed62264a2 [2024-10-13 11:02:44,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec32cc58f/78769498effa48f7931f40d74b2e9cb5 [2024-10-13 11:02:44,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:02:44,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:02:44,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:44,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:02:44,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:02:44,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4491d0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44, skipping insertion in model container [2024-10-13 11:02:44,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:02:44,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:44,451 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:02:44,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:44,540 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:02:44,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44 WrapperNode [2024-10-13 11:02:44,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:44,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:44,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:02:44,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:02:44,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,609 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 127 [2024-10-13 11:02:44,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:44,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:02:44,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:02:44,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:02:44,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,646 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-13 11:02:44,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:02:44,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:02:44,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:02:44,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:02:44,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (1/1) ... [2024-10-13 11:02:44,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:02:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:44,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:02:44,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:02:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 11:02:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 11:02:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:02:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:02:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:02:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:02:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:02:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:02:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:02:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:02:44,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:02:44,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:02:45,130 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-10-13 11:02:45,131 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:02:45,194 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:02:45,195 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 11:02:45,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:45 BoogieIcfgContainer [2024-10-13 11:02:45,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:02:45,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:02:45,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:02:45,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:02:45,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:02:44" (1/3) ... [2024-10-13 11:02:45,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d61b02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:45, skipping insertion in model container [2024-10-13 11:02:45,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:44" (2/3) ... [2024-10-13 11:02:45,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d61b02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:45, skipping insertion in model container [2024-10-13 11:02:45,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:45" (3/3) ... [2024-10-13 11:02:45,205 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2024-10-13 11:02:45,222 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:02:45,223 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-13 11:02:45,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:02:45,268 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;@10443ad0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:02:45,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-13 11:02:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:02:45,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:45,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:02:45,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 5729997, now seen corresponding path program 1 times [2024-10-13 11:02:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:45,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171795311] [2024-10-13 11:02:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:45,554 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-13 11:02:45,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171795311] [2024-10-13 11:02:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171795311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:45,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:45,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774123512] [2024-10-13 11:02:45,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:45,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:45,593 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:45,671 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-13 11:02:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:45,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 11:02:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:45,680 INFO L225 Difference]: With dead ends: 48 [2024-10-13 11:02:45,680 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 11:02:45,682 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-13 11:02:45,688 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:45,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 11:02:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 11:02:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-10-13 11:02:45,723 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 4 [2024-10-13 11:02:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:45,724 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-13 11:02:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-10-13 11:02:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:02:45,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:45,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:02:45,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:02:45,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash 5729998, now seen corresponding path program 1 times [2024-10-13 11:02:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327938918] [2024-10-13 11:02:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:45,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327938918] [2024-10-13 11:02:45,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327938918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:45,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173463220] [2024-10-13 11:02:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:45,879 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:45,930 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-13 11:02:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 11:02:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:45,936 INFO L225 Difference]: With dead ends: 44 [2024-10-13 11:02:45,936 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 11:02:45,937 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-13 11:02:45,938 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:45,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 11:02:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 11:02:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-13 11:02:45,943 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 4 [2024-10-13 11:02:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-13 11:02:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-13 11:02:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:02:45,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:45,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:02:45,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:02:45,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:45,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1214179292, now seen corresponding path program 1 times [2024-10-13 11:02:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323359635] [2024-10-13 11:02:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:46,035 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-13 11:02:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323359635] [2024-10-13 11:02:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323359635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:46,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892888480] [2024-10-13 11:02:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:46,039 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:46,080 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-13 11:02:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:02:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:46,084 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:02:46,085 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:02:46,085 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-13 11:02:46,086 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:46,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:02:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-13 11:02:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-10-13 11:02:46,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 6 [2024-10-13 11:02:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-10-13 11:02:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-10-13 11:02:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:02:46,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:46,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:02:46,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:02:46,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:46,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1211564127, now seen corresponding path program 1 times [2024-10-13 11:02:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909540685] [2024-10-13 11:02:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:46,188 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-13 11:02:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909540685] [2024-10-13 11:02:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909540685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:46,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:46,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:02:46,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568736362] [2024-10-13 11:02:46,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:46,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:46,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:46,192 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:46,249 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-13 11:02:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:02:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:46,251 INFO L225 Difference]: With dead ends: 44 [2024-10-13 11:02:46,252 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 11:02:46,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 11:02:46,253 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:46,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 11:02:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 11:02:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.75) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-13 11:02:46,266 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 6 [2024-10-13 11:02:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:46,266 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-13 11:02:46,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-13 11:02:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:02:46,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:46,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:02:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:02:46,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1211564128, now seen corresponding path program 1 times [2024-10-13 11:02:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747359018] [2024-10-13 11:02:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:46,445 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-13 11:02:46,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747359018] [2024-10-13 11:02:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747359018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:46,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:46,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:02:46,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106608236] [2024-10-13 11:02:46,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:46,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:46,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:46,449 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:46,504 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-13 11:02:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:02:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:46,506 INFO L225 Difference]: With dead ends: 43 [2024-10-13 11:02:46,506 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 11:02:46,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 11:02:46,509 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:46,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 11:02:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 11:02:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-13 11:02:46,515 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 6 [2024-10-13 11:02:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-13 11:02:46,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-13 11:02:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:02:46,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:46,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:46,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:02:46,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash -797009581, now seen corresponding path program 1 times [2024-10-13 11:02:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602145544] [2024-10-13 11:02:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:46,606 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-13 11:02:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602145544] [2024-10-13 11:02:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602145544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026815309] [2024-10-13 11:02:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:46,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:46,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 11:02:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:46,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:02:46,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:46,770 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-13 11:02:46,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:46,799 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-13 11:02:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026815309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:46,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-13 11:02:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690348078] [2024-10-13 11:02:46,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:46,801 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:46,843 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-13 11:02:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 11:02:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:46,844 INFO L225 Difference]: With dead ends: 48 [2024-10-13 11:02:46,844 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 11:02:46,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:46,845 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:46,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 11:02:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 11:02:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-10-13 11:02:46,854 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2024-10-13 11:02:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:46,855 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-10-13 11:02:46,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-10-13 11:02:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:02:46,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:46,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:46,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 11:02:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 11:02:47,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:47,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1486240316, now seen corresponding path program 2 times [2024-10-13 11:02:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274978665] [2024-10-13 11:02:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 11:02:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274978665] [2024-10-13 11:02:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274978665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390373568] [2024-10-13 11:02:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:47,209 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:47,304 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-10-13 11:02:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 11:02:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:47,305 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:02:47,305 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:02:47,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-13 11:02:47,306 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:47,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:02:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 11:02:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-10-13 11:02:47,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2024-10-13 11:02:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-10-13 11:02:47,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-10-13 11:02:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:02:47,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:47,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:47,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 11:02:47,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1486240317, now seen corresponding path program 1 times [2024-10-13 11:02:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041413524] [2024-10-13 11:02:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041413524] [2024-10-13 11:02:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041413524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:47,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:47,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662922150] [2024-10-13 11:02:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:47,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:47,419 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:47,488 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-10-13 11:02:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 11:02:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:47,489 INFO L225 Difference]: With dead ends: 73 [2024-10-13 11:02:47,490 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 11:02:47,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:47,491 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:47,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 11:02:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2024-10-13 11:02:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-13 11:02:47,499 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 16 [2024-10-13 11:02:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:47,499 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-13 11:02:47,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-10-13 11:02:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:02:47,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:47,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:47,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 11:02:47,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1486240372, now seen corresponding path program 1 times [2024-10-13 11:02:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675739308] [2024-10-13 11:02:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675739308] [2024-10-13 11:02:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675739308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436451306] [2024-10-13 11:02:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:47,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:47,762 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:47,912 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-13 11:02:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:02:47,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 11:02:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:47,914 INFO L225 Difference]: With dead ends: 54 [2024-10-13 11:02:47,914 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 11:02:47,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:47,915 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:47,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 11:02:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 11:02:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-10-13 11:02:47,923 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 16 [2024-10-13 11:02:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:47,923 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-10-13 11:02:47,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-10-13 11:02:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 11:02:47,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:47,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:47,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 11:02:47,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1947015230, now seen corresponding path program 1 times [2024-10-13 11:02:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015591619] [2024-10-13 11:02:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:48,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015591619] [2024-10-13 11:02:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015591619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:48,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017565105] [2024-10-13 11:02:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:48,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:48,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:48,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:48,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 11:02:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:48,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 11:02:48,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:48,686 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:02:48,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 11:02:48,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:48,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:02:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:48,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017565105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:49,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-10-13 11:02:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30766825] [2024-10-13 11:02:49,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:49,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 11:02:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 11:02:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-13 11:02:49,047 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:49,487 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2024-10-13 11:02:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:02:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 11:02:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:49,490 INFO L225 Difference]: With dead ends: 67 [2024-10-13 11:02:49,490 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 11:02:49,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:02:49,491 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:49,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 333 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:02:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 11:02:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-10-13 11:02:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.558139534883721) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-10-13 11:02:49,503 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 18 [2024-10-13 11:02:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:49,504 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-10-13 11:02:49,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-10-13 11:02:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 11:02:49,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:49,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:49,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 11:02:49,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 11:02:49,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1947015229, now seen corresponding path program 1 times [2024-10-13 11:02:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893228714] [2024-10-13 11:02:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893228714] [2024-10-13 11:02:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893228714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695738372] [2024-10-13 11:02:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:50,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:50,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:50,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:50,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 11:02:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:50,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 11:02:50,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:50,432 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-13 11:02:50,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:50,521 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-13 11:02:50,528 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-13 11:02:50,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:02:50,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:50,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-13 11:02:50,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 11:02:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:50,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:51,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:51,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-10-13 11:02:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695738372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:51,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2024-10-13 11:02:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638738909] [2024-10-13 11:02:51,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:51,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 11:02:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 11:02:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:02:51,195 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:51,857 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2024-10-13 11:02:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:02:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 11:02:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:51,859 INFO L225 Difference]: With dead ends: 91 [2024-10-13 11:02:51,859 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 11:02:51,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 11:02:51,860 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 68 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:51,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 472 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:02:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 11:02:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2024-10-13 11:02:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5625) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-10-13 11:02:51,864 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 18 [2024-10-13 11:02:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:51,864 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-10-13 11:02:51,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-10-13 11:02:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:02:51,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:51,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:51,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1524255688, now seen corresponding path program 2 times [2024-10-13 11:02:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869581761] [2024-10-13 11:02:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:02:52,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:52,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869581761] [2024-10-13 11:02:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869581761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:52,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:02:52,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531309208] [2024-10-13 11:02:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:52,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:52,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:52,173 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:52,247 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2024-10-13 11:02:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:52,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 11:02:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:52,248 INFO L225 Difference]: With dead ends: 75 [2024-10-13 11:02:52,248 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 11:02:52,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:52,249 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:52,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 124 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 11:02:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-10-13 11:02:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-10-13 11:02:52,253 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 20 [2024-10-13 11:02:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:52,253 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-10-13 11:02:52,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-10-13 11:02:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 11:02:52,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:52,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:52,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 11:02:52,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:52,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:52,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1124381689, now seen corresponding path program 1 times [2024-10-13 11:02:52,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:52,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409973082] [2024-10-13 11:02:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409973082] [2024-10-13 11:02:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409973082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448721345] [2024-10-13 11:02:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:52,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:52,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 11:02:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:02:52,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:52,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448721345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:52,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 11:02:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491235408] [2024-10-13 11:02:52,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:52,533 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:52,588 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-10-13 11:02:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:52,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 11:02:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:52,591 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:02:52,591 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:02:52,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:52,592 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:52,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 95 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:02:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2024-10-13 11:02:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 69 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2024-10-13 11:02:52,602 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 23 [2024-10-13 11:02:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:52,602 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2024-10-13 11:02:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2024-10-13 11:02:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 11:02:52,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:52,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 11:02:52,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 11:02:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1125764409, now seen corresponding path program 1 times [2024-10-13 11:02:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:52,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357892054] [2024-10-13 11:02:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357892054] [2024-10-13 11:02:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357892054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658326400] [2024-10-13 11:02:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:52,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:52,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:52,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 11:02:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:53,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:02:53,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:53,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658326400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:53,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 11:02:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511316361] [2024-10-13 11:02:53,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:02:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:02:53,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:53,132 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:53,190 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-10-13 11:02:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 11:02:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:53,191 INFO L225 Difference]: With dead ends: 62 [2024-10-13 11:02:53,191 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 11:02:53,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:02:53,192 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 78 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:53,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 137 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 11:02:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2024-10-13 11:02:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-10-13 11:02:53,197 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 23 [2024-10-13 11:02:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:53,197 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-13 11:02:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-10-13 11:02:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:02:53,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:53,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:53,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:53,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 11:02:53,399 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 960295144, now seen corresponding path program 2 times [2024-10-13 11:02:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131067402] [2024-10-13 11:02:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 11:02:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131067402] [2024-10-13 11:02:53,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131067402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:53,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56745916] [2024-10-13 11:02:53,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:02:53,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:53,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:53,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:53,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 11:02:53,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 11:02:53,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:02:53,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:02:53,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:02:53,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56745916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:53,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2024-10-13 11:02:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897659598] [2024-10-13 11:02:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:53,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:53,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:53,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:02:53,670 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:53,732 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-10-13 11:02:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:02:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:53,733 INFO L225 Difference]: With dead ends: 63 [2024-10-13 11:02:53,733 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 11:02:53,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:02:53,734 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:53,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 79 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 11:02:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-10-13 11:02:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-10-13 11:02:53,736 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 26 [2024-10-13 11:02:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:53,737 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-10-13 11:02:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-10-13 11:02:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:02:53,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:53,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:53,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 11:02:53,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 11:02:53,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:53,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash 960295199, now seen corresponding path program 1 times [2024-10-13 11:02:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871689435] [2024-10-13 11:02:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 11:02:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871689435] [2024-10-13 11:02:54,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871689435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5627161] [2024-10-13 11:02:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:54,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:54,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:54,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 11:02:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:54,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 11:02:54,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 11:02:54,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:02:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5627161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:02:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-13 11:02:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52346800] [2024-10-13 11:02:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:54,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:54,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:54,200 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:54,252 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-10-13 11:02:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:02:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:54,253 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:02:54,253 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:02:54,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-13 11:02:54,254 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:54,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:02:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:02:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.510204081632653) internal successors, (74), 59 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-10-13 11:02:54,256 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 26 [2024-10-13 11:02:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:54,256 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-10-13 11:02:54,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2024-10-13 11:02:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:02:54,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:54,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:54,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 11:02:54,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:54,459 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 960295200, now seen corresponding path program 1 times [2024-10-13 11:02:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750738055] [2024-10-13 11:02:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:02:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750738055] [2024-10-13 11:02:54,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750738055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:54,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:02:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150408376] [2024-10-13 11:02:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:54,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:54,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:54,684 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:54,805 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-13 11:02:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:02:54,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:02:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:54,807 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:02:54,807 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:02:54,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:54,808 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:54,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 130 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:02:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 11:02:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-13 11:02:54,812 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 26 [2024-10-13 11:02:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:54,812 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-13 11:02:54,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-13 11:02:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:02:54,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:54,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:54,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 11:02:54,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -574216148, now seen corresponding path program 1 times [2024-10-13 11:02:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211357024] [2024-10-13 11:02:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211357024] [2024-10-13 11:02:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211357024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246534781] [2024-10-13 11:02:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:55,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:55,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:55,521 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:55,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 11:02:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:55,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-13 11:02:55,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:55,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:55,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:02:55,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:55,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:02:55,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 42 treesize of output 41 [2024-10-13 11:02:55,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:55,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-10-13 11:02:55,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-13 11:02:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:55,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:56,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array Int Int))) (or (not (= v_ArrVal_950 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1))) is different from false [2024-10-13 11:02:56,125 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-13 11:02:56,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 11:02:56,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_949) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse0))) is different from false [2024-10-13 11:02:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-13 11:02:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246534781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:56,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2024-10-13 11:02:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357722796] [2024-10-13 11:02:56,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 11:02:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 11:02:56,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=623, Unknown=7, NotChecked=102, Total=812 [2024-10-13 11:02:56,229 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:56,766 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-10-13 11:02:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:02:56,767 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 11:02:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:56,767 INFO L225 Difference]: With dead ends: 70 [2024-10-13 11:02:56,767 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 11:02:56,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1167, Unknown=7, NotChecked=142, Total=1482 [2024-10-13 11:02:56,769 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:56,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 396 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 552 Invalid, 0 Unknown, 106 Unchecked, 0.3s Time] [2024-10-13 11:02:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 11:02:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-13 11:02:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.509090909090909) internal successors, (83), 65 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-13 11:02:56,775 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 28 [2024-10-13 11:02:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-13 11:02:56,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-13 11:02:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:02:56,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:56,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:56,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 11:02:56,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 11:02:56,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:02:56,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash -574216147, now seen corresponding path program 1 times [2024-10-13 11:02:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507401382] [2024-10-13 11:02:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507401382] [2024-10-13 11:02:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507401382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365008297] [2024-10-13 11:02:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:57,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:57,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:02:57,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 11:02:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-13 11:02:57,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:58,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:02:58,011 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-13 11:02:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:58,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:02:58,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:02:58,211 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 70 treesize of output 65 [2024-10-13 11:02:58,216 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 49 treesize of output 30 [2024-10-13 11:02:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:58,320 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 45 treesize of output 27 [2024-10-13 11:02:58,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:02:58,326 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 44 treesize of output 26 [2024-10-13 11:02:58,397 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 39 treesize of output 21 [2024-10-13 11:02:58,400 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 32 treesize of output 14 [2024-10-13 11:02:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:58,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:58,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1060 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1060)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1061 (Array Int Int))) (or (not (= v_ArrVal_1061 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1061 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1060 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1060 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1060)) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1061) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))))))) is different from false [2024-10-13 11:02:58,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:58,652 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 46 treesize of output 50 [2024-10-13 11:02:58,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1058 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1058) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1059 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1059) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_prenex_3 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2024-10-13 11:02:58,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:58,977 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 69 treesize of output 60 [2024-10-13 11:02:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2024-10-13 11:02:59,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:02:59,001 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 57 treesize of output 58 [2024-10-13 11:02:59,007 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 47 treesize of output 43 [2024-10-13 11:02:59,010 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 68 treesize of output 56 [2024-10-13 11:02:59,014 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 43 treesize of output 39 [2024-10-13 11:02:59,017 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 39 treesize of output 35 [2024-10-13 11:02:59,083 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:02:59,084 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 13 treesize of output 12 [2024-10-13 11:02:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-13 11:02:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365008297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:59,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2024-10-13 11:02:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771027340] [2024-10-13 11:02:59,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 11:02:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:59,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 11:02:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=979, Unknown=41, NotChecked=130, Total=1260 [2024-10-13 11:02:59,115 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:59,890 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-10-13 11:02:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:02:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 11:02:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:59,891 INFO L225 Difference]: With dead ends: 70 [2024-10-13 11:02:59,892 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 11:02:59,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=1720, Unknown=44, NotChecked=174, Total=2162 [2024-10-13 11:02:59,893 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 131 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 432 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 484 Invalid, 0 Unknown, 101 Unchecked, 0.3s Time] [2024-10-13 11:02:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 11:02:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2024-10-13 11:02:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-10-13 11:02:59,896 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 28 [2024-10-13 11:02:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,896 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-13 11:02:59,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-10-13 11:02:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:02:59,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 11:03:00,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:00,098 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:00,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -574216092, now seen corresponding path program 1 times [2024-10-13 11:03:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743513847] [2024-10-13 11:03:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 11:03:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743513847] [2024-10-13 11:03:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743513847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:03:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002003946] [2024-10-13 11:03:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:03:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:03:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:03:00,179 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:00,223 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-10-13 11:03:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:03:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 11:03:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:00,224 INFO L225 Difference]: With dead ends: 53 [2024-10-13 11:03:00,224 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 11:03:00,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:03:00,225 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:00,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 59 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:03:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 11:03:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 11:03:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-10-13 11:03:00,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 28 [2024-10-13 11:03:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:00,227 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-10-13 11:03:00,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-10-13 11:03:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:03:00,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:00,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:00,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 11:03:00,228 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:00,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash 383666745, now seen corresponding path program 1 times [2024-10-13 11:03:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127837257] [2024-10-13 11:03:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127837257] [2024-10-13 11:03:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127837257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401207245] [2024-10-13 11:03:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:01,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:01,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:01,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 11:03:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-13 11:03:01,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:01,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:01,621 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-13 11:03:01,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:03:01,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:03:01,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:03:01,963 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 80 treesize of output 73 [2024-10-13 11:03:01,971 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 29 treesize of output 19 [2024-10-13 11:03:01,974 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 49 treesize of output 30 [2024-10-13 11:03:02,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:02,108 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 45 treesize of output 27 [2024-10-13 11:03:02,114 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 28 treesize of output 23 [2024-10-13 11:03:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:02,120 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 44 treesize of output 26 [2024-10-13 11:03:02,245 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 39 treesize of output 21 [2024-10-13 11:03:02,248 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 32 treesize of output 14 [2024-10-13 11:03:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:02,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:02,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 0) (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1225) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) .cse0) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (not (= v_ArrVal_1227 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1227 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1226 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1226)))))) is different from false [2024-10-13 11:03:02,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,561 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 40 treesize of output 41 [2024-10-13 11:03:02,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,574 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 83 treesize of output 86 [2024-10-13 11:03:02,579 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 31 treesize of output 20 [2024-10-13 11:03:02,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_1222 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 0)))) (and (or (forall ((v_ArrVal_1221 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) .cse1) (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (or (< .cse2 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| .cse2)))) (or (forall ((v_ArrVal_1221 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) .cse1) (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse1)))) is different from false [2024-10-13 11:03:02,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1222 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0)))) (and (or (= (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) .cse0) (or (forall ((v_ArrVal_1221 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |c_ULTIMATE.start_main_~s~0#1.base|))) .cse0) (or (forall ((v_ArrVal_1221 (Array Int Int))) (= .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) .cse0) (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse3 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) .cse3)))))))) is different from false [2024-10-13 11:03:02,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (let ((.cse2 (forall ((v_ArrVal_1222 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (or (forall ((v_ArrVal_1221 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.base|))) .cse2) (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (= .cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (< .cse3 0)))) (or (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) .cse2) (or (forall ((v_ArrVal_1221 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) .cse2))))) is different from false [2024-10-13 11:03:02,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (let ((.cse3 (forall ((v_ArrVal_1222 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1222) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1222) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (or (= .cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)) (< .cse0 0)))) (or .cse3 (forall ((v_ArrVal_1221 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1221) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1221 (Array Int Int))) (= .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1221) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) .cse3))))) is different from false [2024-10-13 11:03:02,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,790 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 137 treesize of output 108 [2024-10-13 11:03:02,796 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 155 treesize of output 125 [2024-10-13 11:03:02,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,806 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 113 treesize of output 104 [2024-10-13 11:03:02,810 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 132 treesize of output 114 [2024-10-13 11:03:02,816 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 59 treesize of output 55 [2024-10-13 11:03:02,820 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 55 treesize of output 51 [2024-10-13 11:03:02,823 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 51 treesize of output 43 [2024-10-13 11:03:02,826 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 43 treesize of output 39 [2024-10-13 11:03:02,830 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 39 treesize of output 35 [2024-10-13 11:03:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-13 11:03:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401207245] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:02,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2024-10-13 11:03:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28897045] [2024-10-13 11:03:02,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:02,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-13 11:03:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-13 11:03:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1503, Unknown=6, NotChecked=410, Total=2070 [2024-10-13 11:03:02,917 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 46 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:03,992 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-10-13 11:03:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 11:03:03,992 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:03:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:03,993 INFO L225 Difference]: With dead ends: 57 [2024-10-13 11:03:03,993 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 11:03:03,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=320, Invalid=2660, Unknown=10, NotChecked=550, Total=3540 [2024-10-13 11:03:03,995 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:03,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 565 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 719 Invalid, 0 Unknown, 280 Unchecked, 0.4s Time] [2024-10-13 11:03:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 11:03:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-10-13 11:03:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-13 11:03:03,997 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 31 [2024-10-13 11:03:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:03,997 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-13 11:03:03,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.891304347826087) internal successors, (87), 46 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-13 11:03:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 11:03:03,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:03,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:04,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 11:03:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 11:03:04,199 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:04,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1875209012, now seen corresponding path program 1 times [2024-10-13 11:03:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:04,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775753769] [2024-10-13 11:03:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775753769] [2024-10-13 11:03:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775753769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507980727] [2024-10-13 11:03:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:04,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:04,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 11:03:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:04,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 11:03:04,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:04,828 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 11 [2024-10-13 11:03:04,944 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-13 11:03:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:04,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:05,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-10-13 11:03:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507980727] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:05,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-10-13 11:03:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265821273] [2024-10-13 11:03:05,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:05,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 11:03:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 11:03:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-13 11:03:05,045 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:05,319 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-10-13 11:03:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:03:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-13 11:03:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:05,321 INFO L225 Difference]: With dead ends: 57 [2024-10-13 11:03:05,321 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 11:03:05,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:03:05,322 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 100 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:05,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 331 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:03:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 11:03:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-13 11:03:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-13 11:03:05,324 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 35 [2024-10-13 11:03:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:05,324 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-13 11:03:05,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-13 11:03:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 11:03:05,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:05,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:05,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 11:03:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 11:03:05,526 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1824371829, now seen corresponding path program 1 times [2024-10-13 11:03:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224817223] [2024-10-13 11:03:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:03:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224817223] [2024-10-13 11:03:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224817223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:05,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:05,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:03:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732049077] [2024-10-13 11:03:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:05,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:03:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:05,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:03:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:03:05,631 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:05,693 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-13 11:03:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:03:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-13 11:03:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:05,694 INFO L225 Difference]: With dead ends: 56 [2024-10-13 11:03:05,694 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 11:03:05,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-13 11:03:05,695 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:05,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 11:03:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 11:03:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.24) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-10-13 11:03:05,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 37 [2024-10-13 11:03:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:05,698 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-13 11:03:05,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-10-13 11:03:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 11:03:05,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:05,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:05,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 11:03:05,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1824371828, now seen corresponding path program 1 times [2024-10-13 11:03:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186820921] [2024-10-13 11:03:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:03:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186820921] [2024-10-13 11:03:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186820921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:05,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:03:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278081650] [2024-10-13 11:03:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:03:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:03:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:03:05,905 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:06,010 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-10-13 11:03:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:03:06,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-13 11:03:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:06,011 INFO L225 Difference]: With dead ends: 57 [2024-10-13 11:03:06,011 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 11:03:06,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:03:06,012 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:06,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 11:03:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-13 11:03:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-13 11:03:06,014 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 37 [2024-10-13 11:03:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:06,014 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-13 11:03:06,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-13 11:03:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 11:03:06,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:06,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 11:03:06,015 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -366228560, now seen corresponding path program 2 times [2024-10-13 11:03:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768387569] [2024-10-13 11:03:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:03:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768387569] [2024-10-13 11:03:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768387569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889852908] [2024-10-13 11:03:06,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:03:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:06,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 11:03:06,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:03:06,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:03:06,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:03:06,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:03:06,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 11:03:06,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889852908] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:06,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 11:03:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856212525] [2024-10-13 11:03:06,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:06,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:03:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:03:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:03:06,425 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:06,481 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-10-13 11:03:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:03:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-13 11:03:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:06,482 INFO L225 Difference]: With dead ends: 50 [2024-10-13 11:03:06,482 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 11:03:06,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:03:06,483 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:06,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 92 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:03:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 11:03:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 11:03:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-13 11:03:06,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2024-10-13 11:03:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:06,484 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-13 11:03:06,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-13 11:03:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 11:03:06,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:06,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:06,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 11:03:06,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 11:03:06,690 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:06,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash -720953251, now seen corresponding path program 1 times [2024-10-13 11:03:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120101107] [2024-10-13 11:03:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:06,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:03:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120101107] [2024-10-13 11:03:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120101107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:06,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:03:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101693092] [2024-10-13 11:03:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:03:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:03:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:03:06,788 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:06,869 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-10-13 11:03:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:03:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-13 11:03:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:06,870 INFO L225 Difference]: With dead ends: 52 [2024-10-13 11:03:06,870 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 11:03:06,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:03:06,870 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:06,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 11:03:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-13 11:03:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-13 11:03:06,873 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 38 [2024-10-13 11:03:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:06,873 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 11:03:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-13 11:03:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 11:03:06,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:06,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:06,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 11:03:06,874 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -874630254, now seen corresponding path program 1 times [2024-10-13 11:03:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571538624] [2024-10-13 11:03:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 11:03:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571538624] [2024-10-13 11:03:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571538624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:03:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742585819] [2024-10-13 11:03:06,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:03:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:03:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:03:06,997 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:07,076 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-13 11:03:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:03:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-13 11:03:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:07,077 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:03:07,077 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:03:07,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:03:07,078 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:07,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:03:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 11:03:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-13 11:03:07,081 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 39 [2024-10-13 11:03:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:07,081 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-13 11:03:07,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-13 11:03:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:03:07,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:07,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:07,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 11:03:07,083 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:07,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1456849460, now seen corresponding path program 1 times [2024-10-13 11:03:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680837867] [2024-10-13 11:03:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 11:03:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:07,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680837867] [2024-10-13 11:03:07,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680837867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209645339] [2024-10-13 11:03:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:07,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:07,903 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:07,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 11:03:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:08,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 11:03:08,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:08,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:08,155 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-13 11:03:08,199 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-13 11:03:08,311 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:08,311 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-13 11:03:08,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:08,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-13 11:03:08,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:08,458 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 27 treesize of output 21 [2024-10-13 11:03:08,526 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 11:03:08,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-10-13 11:03:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:03:08,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:08,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1755 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1755 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1755)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1755) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) (forall ((v_ArrVal_1755 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1755 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1755)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1755) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2024-10-13 11:03:08,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:08,785 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 45 treesize of output 49 [2024-10-13 11:03:08,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_prenex_8 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_prenex_9 Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_8) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_9 v_DerPreprocessor_8) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_9))) (forall ((v_ArrVal_1754 (Array Int Int)) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_56| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_56|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_56| v_DerPreprocessor_9) 4)))))) is different from false [2024-10-13 11:03:08,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1754 (Array Int Int)) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_56| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_56|) (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_56| v_DerPreprocessor_9) 4)))) (forall ((v_prenex_8 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_prenex_9 Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_8) |c_ULTIMATE.start_main_~s~0#1.base|) v_prenex_9 v_DerPreprocessor_8) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| v_prenex_9))))) is different from false [2024-10-13 11:03:08,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1754 (Array Int Int)) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_56| Int)) (or (= .cse0 (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1754) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_56| v_DerPreprocessor_9) 4)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_56|))) (forall ((v_prenex_8 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_prenex_9 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_8) |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_prenex_9 v_DerPreprocessor_8) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_prenex_9))))) is different from false [2024-10-13 11:03:09,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:09,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-13 11:03:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-13 11:03:09,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-13 11:03:09,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:09,018 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 34 [2024-10-13 11:03:09,050 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 11:03:09,051 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 22 treesize of output 1 [2024-10-13 11:03:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-10-13 11:03:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209645339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:09,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 32 [2024-10-13 11:03:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798969764] [2024-10-13 11:03:09,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:09,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 11:03:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 11:03:09,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=724, Unknown=4, NotChecked=228, Total=1056 [2024-10-13 11:03:09,104 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 33 states, 32 states have (on average 2.65625) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:09,745 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-13 11:03:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:03:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.65625) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-13 11:03:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:09,746 INFO L225 Difference]: With dead ends: 58 [2024-10-13 11:03:09,746 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 11:03:09,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=1111, Unknown=4, NotChecked=284, Total=1560 [2024-10-13 11:03:09,746 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:09,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 239 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 619 Invalid, 0 Unknown, 191 Unchecked, 0.3s Time] [2024-10-13 11:03:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 11:03:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-10-13 11:03:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-10-13 11:03:09,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 42 [2024-10-13 11:03:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-10-13 11:03:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.65625) internal successors, (85), 33 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-10-13 11:03:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:03:09,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:09,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:09,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:09,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-13 11:03:09,950 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1456849461, now seen corresponding path program 1 times [2024-10-13 11:03:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489514528] [2024-10-13 11:03:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:03:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489514528] [2024-10-13 11:03:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489514528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017108143] [2024-10-13 11:03:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:11,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:11,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:11,243 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:11,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 11:03:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:11,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-13 11:03:11,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:11,445 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-13 11:03:11,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:11,520 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-13 11:03:11,524 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-13 11:03:11,601 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-13 11:03:11,607 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-13 11:03:11,762 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:11,762 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-13 11:03:11,766 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-13 11:03:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:11,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-13 11:03:11,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:11,846 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-13 11:03:12,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-13 11:03:12,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,037 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 27 treesize of output 21 [2024-10-13 11:03:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:03:12,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:12,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1870 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1870 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1870)) (forall ((v_ArrVal_1871 (Array Int Int))) (or (not (= v_ArrVal_1871 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1871 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1870) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1871) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) (forall ((v_ArrVal_1870 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1870 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1870)) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1870) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2024-10-13 11:03:12,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (and (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1869 (Array Int Int))) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_13) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_ArrVal_1868 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_ArrVal_1869 (Array Int Int))) (or (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_11) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1868) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_12) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))))) is different from false [2024-10-13 11:03:12,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1869 (Array Int Int))) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_13) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_ArrVal_1868 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_ArrVal_1869 (Array Int Int))) (or (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_11) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1868) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_12) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))))) is different from false [2024-10-13 11:03:12,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_ArrVal_1869 (Array Int Int))) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_11) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1868) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_12) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))) (forall ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_60| Int) (v_ArrVal_1869 (Array Int Int))) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1869) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_60| v_DerPreprocessor_13) 4))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_60|))))) is different from false [2024-10-13 11:03:12,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,707 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 47 treesize of output 48 [2024-10-13 11:03:12,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,713 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 37 treesize of output 38 [2024-10-13 11:03:12,730 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 66 treesize of output 62 [2024-10-13 11:03:12,734 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 112 treesize of output 106 [2024-10-13 11:03:12,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,748 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 50 treesize of output 52 [2024-10-13 11:03:12,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,764 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 57 treesize of output 59 [2024-10-13 11:03:12,772 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 40 treesize of output 38 [2024-10-13 11:03:12,779 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 47 treesize of output 45 [2024-10-13 11:03:12,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,845 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 23 treesize of output 24 [2024-10-13 11:03:12,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:12,850 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 21 treesize of output 17 [2024-10-13 11:03:12,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:12,854 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 14 treesize of output 10 [2024-10-13 11:03:13,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:13,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-10-13 11:03:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-10-13 11:03:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017108143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:13,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:13,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2024-10-13 11:03:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732795310] [2024-10-13 11:03:13,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-13 11:03:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 11:03:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1709, Unknown=18, NotChecked=348, Total=2256 [2024-10-13 11:03:13,117 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 48 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 48 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:13,999 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-13 11:03:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:03:13,999 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 48 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-13 11:03:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:14,000 INFO L225 Difference]: With dead ends: 59 [2024-10-13 11:03:14,000 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 11:03:14,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=2568, Unknown=18, NotChecked=428, Total=3306 [2024-10-13 11:03:14,001 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 39 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:14,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 285 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 617 Invalid, 0 Unknown, 192 Unchecked, 0.3s Time] [2024-10-13 11:03:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 11:03:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-13 11:03:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-13 11:03:14,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 42 [2024-10-13 11:03:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:14,004 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-13 11:03:14,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3404255319148937) internal successors, (110), 48 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-13 11:03:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 11:03:14,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:14,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:14,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:14,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:14,206 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:14,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2082308396, now seen corresponding path program 1 times [2024-10-13 11:03:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579363514] [2024-10-13 11:03:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579363514] [2024-10-13 11:03:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579363514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168555690] [2024-10-13 11:03:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:14,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:14,913 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:14,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 11:03:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:15,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-13 11:03:15,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:15,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:15,182 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-13 11:03:15,239 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-13 11:03:15,241 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-13 11:03:15,349 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-13 11:03:15,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:15,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2024-10-13 11:03:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:15,494 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 32 treesize of output 16 [2024-10-13 11:03:15,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,588 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 26 treesize of output 20 [2024-10-13 11:03:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 11:03:15,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:15,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1982 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1982)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1982) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)))) is different from false [2024-10-13 11:03:15,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_65| Int) (v_ArrVal_1981 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_65|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_65| v_DerPreprocessor_14) 4) 0)) (not (= v_ArrVal_1981 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1981 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2024-10-13 11:03:15,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_65| Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1981 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1981)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_65|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_65| v_DerPreprocessor_14) 4) 0)) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|))))) is different from false [2024-10-13 11:03:15,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_65| Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1981) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_65| v_DerPreprocessor_14) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_65|) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (not (= (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1981 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)) v_ArrVal_1981)))))) is different from false [2024-10-13 11:03:15,806 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_66| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_65| Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (or (not (= v_ArrVal_1981 (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66| (select v_ArrVal_1981 |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_65|) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_66|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1981) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_65| v_DerPreprocessor_14) 4) 0)))))) is different from false [2024-10-13 11:03:15,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,830 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 46 treesize of output 36 [2024-10-13 11:03:15,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,844 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 52 treesize of output 54 [2024-10-13 11:03:15,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,887 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 145 treesize of output 143 [2024-10-13 11:03:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-10-13 11:03:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168555690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:16,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 44 [2024-10-13 11:03:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445603326] [2024-10-13 11:03:16,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-13 11:03:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:16,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-13 11:03:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1340, Unknown=5, NotChecked=390, Total=1892 [2024-10-13 11:03:16,104 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:16,730 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-13 11:03:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:03:16,731 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-13 11:03:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:16,731 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:03:16,731 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:03:16,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=2194, Unknown=5, NotChecked=500, Total=2970 [2024-10-13 11:03:16,733 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:16,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 387 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 672 Invalid, 0 Unknown, 220 Unchecked, 0.3s Time] [2024-10-13 11:03:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:03:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-10-13 11:03:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.16) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-10-13 11:03:16,735 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 43 [2024-10-13 11:03:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:16,735 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-10-13 11:03:16,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 44 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-10-13 11:03:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:03:16,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:16,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:16,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:16,937 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:16,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash -126966789, now seen corresponding path program 1 times [2024-10-13 11:03:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869771182] [2024-10-13 11:03:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869771182] [2024-10-13 11:03:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869771182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189812437] [2024-10-13 11:03:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:17,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:17,674 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:17,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 11:03:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:17,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 11:03:17,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:17,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:17,909 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-13 11:03:17,925 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-13 11:03:18,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:03:18,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:18,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-13 11:03:18,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:18,135 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 27 treesize of output 21 [2024-10-13 11:03:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:03:18,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:18,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2091 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2091) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2091 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_2091)))) is different from false [2024-10-13 11:03:18,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_70| Int) (v_ArrVal_2090 (Array Int Int)) (v_DerPreprocessor_16 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_70|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2090) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_70| v_DerPreprocessor_16) 4) |c_#StackHeapBarrier|))) is different from false [2024-10-13 11:03:18,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_70| Int) (v_ArrVal_2090 (Array Int Int)) (v_DerPreprocessor_16 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_70|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2090) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_70| v_DerPreprocessor_16) 4) |c_#StackHeapBarrier|))) is different from false [2024-10-13 11:03:18,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-13 11:03:18,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-13 11:03:18,532 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 26 treesize of output 24 [2024-10-13 11:03:18,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:18,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 11:03:18,602 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:18,602 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 13 treesize of output 12 [2024-10-13 11:03:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2024-10-13 11:03:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189812437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:18,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 31 [2024-10-13 11:03:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217228745] [2024-10-13 11:03:18,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 11:03:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 11:03:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=694, Unknown=29, NotChecked=168, Total=992 [2024-10-13 11:03:18,610 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:19,073 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-13 11:03:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:03:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-13 11:03:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:19,074 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:03:19,074 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:03:19,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1215, Unknown=34, NotChecked=222, Total=1640 [2024-10-13 11:03:19,074 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:19,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 265 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 139 Unchecked, 0.2s Time] [2024-10-13 11:03:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:03:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-13 11:03:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-10-13 11:03:19,076 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2024-10-13 11:03:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:19,076 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-10-13 11:03:19,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-10-13 11:03:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:03:19,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:19,077 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:19,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:19,278 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-13 11:03:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1398738219, now seen corresponding path program 2 times [2024-10-13 11:03:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692265456] [2024-10-13 11:03:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:03:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692265456] [2024-10-13 11:03:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692265456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030504779] [2024-10-13 11:03:20,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:03:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:20,663 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 11:03:20,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:03:20,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:03:20,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-13 11:03:20,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:20,894 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-13 11:03:20,898 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-13 11:03:20,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:20,926 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-13 11:03:20,968 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-13 11:03:20,972 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-13 11:03:20,980 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-13 11:03:20,985 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-13 11:03:21,018 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-13 11:03:21,024 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-13 11:03:21,244 INFO L349 Elim1Store]: treesize reduction 92, result has 35.2 percent of original size [2024-10-13 11:03:21,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 96 [2024-10-13 11:03:21,317 INFO L349 Elim1Store]: treesize reduction 64, result has 47.5 percent of original size [2024-10-13 11:03:21,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 67 [2024-10-13 11:03:21,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:21,784 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-10-13 11:03:21,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 138 treesize of output 142 [2024-10-13 11:03:21,835 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-10-13 11:03:21,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 121 [2024-10-13 11:03:22,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:22,226 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 13 treesize of output 11 [2024-10-13 11:03:22,251 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 7 treesize of output 3 [2024-10-13 11:03:22,409 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 7 treesize of output 3 [2024-10-13 11:03:26,829 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-10-13 11:03:26,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2024-10-13 11:03:26,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:26,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-13 11:03:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 11:03:26,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:04:02,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_76| Int)) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2210 (Array Int Int))) (or (forall ((v_ArrVal_2211 (Array Int Int))) (or (not (= v_ArrVal_2211 (store (select |c_#memory_$Pointer$#1.offset| .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_76| (select v_ArrVal_2211 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|)))) (forall ((v_ArrVal_2212 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2211) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2212) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2210) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 4) 0)))) (not (= v_ArrVal_2210 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76| (select v_ArrVal_2210 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_76| Int)) (or (< .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|) (forall ((v_ArrVal_2210 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_75| Int) (v_ArrVal_2213 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2210))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_75|) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2213) (select v_ArrVal_2213 4)) 4) 0) (not (= v_ArrVal_2213 (store (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_75| (select v_ArrVal_2213 |v_ULTIMATE.start_sll_update_at_~head#1.offset_75|))))))) (not (= v_ArrVal_2210 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76| (select v_ArrVal_2210 |v_ULTIMATE.start_sll_update_at_~head#1.offset_76|))))))))))) is different from false