./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c4f91361 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 ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 15:45:43,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:45:43,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 15:45:43,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:45:43,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:45:43,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:45:43,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:45:43,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:45:43,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:45:43,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:45:43,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:45:43,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:45:43,880 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:45:43,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:45:43,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:45:43,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:45:43,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:45:43,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:45:43,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 15:45:43,884 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 15:45:43,884 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 15:45:43,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:45:43,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 15:45:43,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 15:45:43,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:45:43,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:45:43,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:45:43,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:45:43,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:45:43,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:45:43,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:45:43,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:45:43,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:45:43,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:45:43,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:45:43,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:45:43,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:45:43,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:45:43,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:45:43,890 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2023-11-23 15:45:44,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:45:44,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:45:44,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:45:44,187 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:45:44,187 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:45:44,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2023-11-23 15:45:45,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:45:45,574 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:45:45,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2023-11-23 15:45:45,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76410349b/028f9d775c5640b389b89933da8a1f33/FLAG383287b06 [2023-11-23 15:45:45,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76410349b/028f9d775c5640b389b89933da8a1f33 [2023-11-23 15:45:45,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:45:45,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:45:45,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:45:45,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:45:45,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:45:45,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:45" (1/1) ... [2023-11-23 15:45:45,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d96edb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:45, skipping insertion in model container [2023-11-23 15:45:45,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:45" (1/1) ... [2023-11-23 15:45:45,664 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:45:45,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:45:46,008 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:45:46,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:45:46,096 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:45:46,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46 WrapperNode [2023-11-23 15:45:46,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:45:46,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:45:46,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:45:46,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:45:46,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,156 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2023-11-23 15:45:46,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:45:46,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:45:46,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:45:46,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:45:46,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:45:46,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:45:46,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:45:46,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:45:46,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (1/1) ... [2023-11-23 15:45:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:45:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:46,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 15:45:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 15:45:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 15:45:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 15:45:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 15:45:46,297 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 15:45:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 15:45:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:45:46,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:45:46,406 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:45:46,408 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:45:46,839 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:45:46,876 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:45:46,876 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-23 15:45:46,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:46 BoogieIcfgContainer [2023-11-23 15:45:46,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:45:46,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:45:46,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:45:46,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:45:46,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:45:45" (1/3) ... [2023-11-23 15:45:46,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184225f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:46, skipping insertion in model container [2023-11-23 15:45:46,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:46" (2/3) ... [2023-11-23 15:45:46,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184225f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:46, skipping insertion in model container [2023-11-23 15:45:46,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:46" (3/3) ... [2023-11-23 15:45:46,885 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2023-11-23 15:45:46,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:45:46,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-23 15:45:46,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:45:46,949 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@58c10a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:45:46,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-11-23 15:45:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 15:45:46,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:46,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 15:45:46,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:46,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash 222887514, now seen corresponding path program 1 times [2023-11-23 15:45:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744979403] [2023-11-23 15:45:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:45:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744979403] [2023-11-23 15:45:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744979403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:45:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582757988] [2023-11-23 15:45:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:45:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:45:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:45:47,281 INFO L87 Difference]: Start difference. First operand has 80 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 76 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:45:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:47,392 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2023-11-23 15:45:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:45:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 15:45:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:47,404 INFO L225 Difference]: With dead ends: 76 [2023-11-23 15:45:47,404 INFO L226 Difference]: Without dead ends: 74 [2023-11-23 15:45:47,406 INFO L412 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 [2023-11-23 15:45:47,411 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:47,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 110 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-23 15:45:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-23 15:45:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.95) internal successors, (78), 70 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2023-11-23 15:45:47,459 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 5 [2023-11-23 15:45:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:47,459 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2023-11-23 15:45:47,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:45:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2023-11-23 15:45:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 15:45:47,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:47,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 15:45:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:45:47,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:47,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash 222887515, now seen corresponding path program 1 times [2023-11-23 15:45:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:47,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230853329] [2023-11-23 15:45:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:45:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230853329] [2023-11-23 15:45:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230853329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:45:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969962689] [2023-11-23 15:45:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:47,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:45:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:47,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:45:47,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:45:47,586 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:45:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:47,636 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-11-23 15:45:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:45:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 15:45:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:47,639 INFO L225 Difference]: With dead ends: 71 [2023-11-23 15:45:47,639 INFO L226 Difference]: Without dead ends: 71 [2023-11-23 15:45:47,639 INFO L412 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 [2023-11-23 15:45:47,640 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:47,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:45:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-23 15:45:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-23 15:45:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.875) internal successors, (75), 67 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-23 15:45:47,648 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 5 [2023-11-23 15:45:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:47,648 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-23 15:45:47,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:45:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-23 15:45:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:45:47,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:47,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:47,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:45:47,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:47,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 211138607, now seen corresponding path program 1 times [2023-11-23 15:45:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522494567] [2023-11-23 15:45:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:45:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522494567] [2023-11-23 15:45:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522494567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:47,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:45:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241323205] [2023-11-23 15:45:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:47,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:45:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:45:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:45:47,795 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 15:45:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:47,890 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2023-11-23 15:45:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:45:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-23 15:45:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:47,892 INFO L225 Difference]: With dead ends: 82 [2023-11-23 15:45:47,892 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 15:45:47,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:45:47,896 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:47,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 160 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 15:45:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2023-11-23 15:45:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.853658536585366) internal successors, (76), 68 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-11-23 15:45:47,910 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 11 [2023-11-23 15:45:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:47,911 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-11-23 15:45:47,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 15:45:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-11-23 15:45:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 15:45:47,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:47,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 15:45:47,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:47,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -709309976, now seen corresponding path program 1 times [2023-11-23 15:45:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:47,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388093655] [2023-11-23 15:45:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 15:45:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388093655] [2023-11-23 15:45:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388093655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:48,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:48,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 15:45:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109110294] [2023-11-23 15:45:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:48,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:45:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:45:48,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:45:48,220 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:48,400 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-11-23 15:45:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:45:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-23 15:45:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:48,403 INFO L225 Difference]: With dead ends: 71 [2023-11-23 15:45:48,404 INFO L226 Difference]: Without dead ends: 71 [2023-11-23 15:45:48,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:45:48,411 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:48,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:45:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-23 15:45:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-23 15:45:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.829268292682927) internal successors, (75), 67 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-23 15:45:48,420 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 19 [2023-11-23 15:45:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:48,420 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-23 15:45:48,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-23 15:45:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 15:45:48,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:48,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:48,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 15:45:48,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:48,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -709309975, now seen corresponding path program 1 times [2023-11-23 15:45:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129558259] [2023-11-23 15:45:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:48,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129558259] [2023-11-23 15:45:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129558259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 15:45:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530762426] [2023-11-23 15:45:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:45:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:45:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:45:48,679 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:48,821 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2023-11-23 15:45:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:45:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-23 15:45:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:48,823 INFO L225 Difference]: With dead ends: 70 [2023-11-23 15:45:48,823 INFO L226 Difference]: Without dead ends: 70 [2023-11-23 15:45:48,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:45:48,824 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:48,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 268 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-23 15:45:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-23 15:45:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 66 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-11-23 15:45:48,829 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 19 [2023-11-23 15:45:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:48,829 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-11-23 15:45:48,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-11-23 15:45:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 15:45:48,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:48,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:48,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 15:45:48,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:48,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1252912841, now seen corresponding path program 1 times [2023-11-23 15:45:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:48,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722909593] [2023-11-23 15:45:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722909593] [2023-11-23 15:45:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722909593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962715528] [2023-11-23 15:45:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:49,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:49,196 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) [2023-11-23 15:45:49,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 15:45:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:49,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-23 15:45:49,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:45:49,420 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-23 15:45:49,469 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 15:45:49,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 15:45:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-23 15:45:49,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:45:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962715528] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:45:49,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:45:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2023-11-23 15:45:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870722892] [2023-11-23 15:45:49,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:49,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 15:45:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 15:45:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-11-23 15:45:49,646 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:45:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:49,890 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2023-11-23 15:45:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:45:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-23 15:45:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:49,892 INFO L225 Difference]: With dead ends: 77 [2023-11-23 15:45:49,892 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 15:45:49,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=116, Unknown=1, NotChecked=22, Total=182 [2023-11-23 15:45:49,893 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:49,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 316 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2023-11-23 15:45:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 15:45:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-23 15:45:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 70 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:45:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-11-23 15:45:49,899 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 21 [2023-11-23 15:45:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:49,899 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-11-23 15:45:49,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:45:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-11-23 15:45:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 15:45:49,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:49,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:49,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 15:45:50,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 15:45:50,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:50,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1252912842, now seen corresponding path program 1 times [2023-11-23 15:45:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972316763] [2023-11-23 15:45:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972316763] [2023-11-23 15:45:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972316763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:50,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520872550] [2023-11-23 15:45:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:50,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:50,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:50,640 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) [2023-11-23 15:45:50,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 15:45:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:50,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 15:45:50,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:50,786 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 [2023-11-23 15:45:50,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:45:50,925 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-23 15:45:50,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:45:50,955 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 [2023-11-23 15:45:50,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:45:50,962 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 [2023-11-23 15:45:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-23 15:45:50,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520872550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:51,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:45:51,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-11-23 15:45:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36248548] [2023-11-23 15:45:51,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:51,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 15:45:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:51,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 15:45:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2023-11-23 15:45:51,076 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:45:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:51,334 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2023-11-23 15:45:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:45:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-23 15:45:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:51,335 INFO L225 Difference]: With dead ends: 77 [2023-11-23 15:45:51,335 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 15:45:51,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-11-23 15:45:51,336 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:51,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 312 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 299 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2023-11-23 15:45:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 15:45:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-23 15:45:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:45:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-11-23 15:45:51,341 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 21 [2023-11-23 15:45:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:51,341 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-11-23 15:45:51,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:45:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-11-23 15:45:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:45:51,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:51,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:51,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 15:45:51,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-23 15:45:51,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:51,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1458551455, now seen corresponding path program 1 times [2023-11-23 15:45:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193395383] [2023-11-23 15:45:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193395383] [2023-11-23 15:45:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193395383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415230092] [2023-11-23 15:45:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:51,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:51,721 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) [2023-11-23 15:45:51,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 15:45:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:51,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 15:45:51,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:51,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415230092] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:45:51,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:45:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-23 15:45:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256910811] [2023-11-23 15:45:51,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:51,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:45:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:45:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:45:51,895 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:52,008 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2023-11-23 15:45:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:45:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-23 15:45:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:52,010 INFO L225 Difference]: With dead ends: 76 [2023-11-23 15:45:52,010 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 15:45:52,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:45:52,011 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:52,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 15:45:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-11-23 15:45:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:45:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-23 15:45:52,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 23 [2023-11-23 15:45:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:52,015 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-23 15:45:52,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:45:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-23 15:45:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 15:45:52,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:52,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:52,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 15:45:52,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:52,228 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:52,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2034325814, now seen corresponding path program 1 times [2023-11-23 15:45:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111427086] [2023-11-23 15:45:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:45:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111427086] [2023-11-23 15:45:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111427086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205034326] [2023-11-23 15:45:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:52,342 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) [2023-11-23 15:45:52,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 15:45:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:52,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-23 15:45:52,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:52,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:45:52,543 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-23 15:45:52,579 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 15:45:52,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 15:45:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-23 15:45:52,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205034326] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:52,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:45:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2023-11-23 15:45:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689107630] [2023-11-23 15:45:52,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:52,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 15:45:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 15:45:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2023-11-23 15:45:52,638 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:45:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:52,852 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2023-11-23 15:45:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:45:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2023-11-23 15:45:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:52,854 INFO L225 Difference]: With dead ends: 76 [2023-11-23 15:45:52,854 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 15:45:52,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-11-23 15:45:52,855 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:52,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 304 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2023-11-23 15:45:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 15:45:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-11-23 15:45:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.711111111111111) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:45:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-11-23 15:45:52,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 24 [2023-11-23 15:45:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:52,859 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-11-23 15:45:52,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:45:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-11-23 15:45:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 15:45:52,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:52,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:52,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 15:45:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:53,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:53,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2034325813, now seen corresponding path program 1 times [2023-11-23 15:45:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886201430] [2023-11-23 15:45:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886201430] [2023-11-23 15:45:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886201430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058593807] [2023-11-23 15:45:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:53,279 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) [2023-11-23 15:45:53,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 15:45:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:53,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 15:45:53,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:53,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:45:53,434 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 [2023-11-23 15:45:53,558 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-23 15:45:53,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:45:53,588 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 [2023-11-23 15:45:53,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:45:53,595 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 [2023-11-23 15:45:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-23 15:45:53,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058593807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:53,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:45:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-23 15:45:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919999650] [2023-11-23 15:45:53,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 15:45:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 15:45:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2023-11-23 15:45:53,750 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:45:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:54,048 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2023-11-23 15:45:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:45:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2023-11-23 15:45:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:54,051 INFO L225 Difference]: With dead ends: 91 [2023-11-23 15:45:54,051 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 15:45:54,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2023-11-23 15:45:54,052 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:54,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 467 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2023-11-23 15:45:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 15:45:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2023-11-23 15:45:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 78 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2023-11-23 15:45:54,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 24 [2023-11-23 15:45:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:54,056 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2023-11-23 15:45:54,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:45:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2023-11-23 15:45:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 15:45:54,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:54,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:54,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 15:45:54,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 15:45:54,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:54,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1360409211, now seen corresponding path program 1 times [2023-11-23 15:45:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452515199] [2023-11-23 15:45:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 15:45:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:54,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452515199] [2023-11-23 15:45:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452515199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 15:45:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953277452] [2023-11-23 15:45:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:54,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:45:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:45:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:45:54,436 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:54,586 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-11-23 15:45:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:45:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-23 15:45:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:54,588 INFO L225 Difference]: With dead ends: 85 [2023-11-23 15:45:54,588 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 15:45:54,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:45:54,589 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:54,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 15:45:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2023-11-23 15:45:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 77 states have internal predecessors, (90), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2023-11-23 15:45:54,592 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 25 [2023-11-23 15:45:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:54,592 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2023-11-23 15:45:54,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2023-11-23 15:45:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 15:45:54,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:54,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:54,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 15:45:54,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:54,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1360409212, now seen corresponding path program 1 times [2023-11-23 15:45:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115308390] [2023-11-23 15:45:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115308390] [2023-11-23 15:45:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115308390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 15:45:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56640339] [2023-11-23 15:45:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:45:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:45:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:45:54,858 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:54,999 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2023-11-23 15:45:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:45:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-23 15:45:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:55,000 INFO L225 Difference]: With dead ends: 82 [2023-11-23 15:45:55,000 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 15:45:55,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 15:45:55,001 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:55,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 15:45:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-23 15:45:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 76 states have internal predecessors, (89), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-11-23 15:45:55,004 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 25 [2023-11-23 15:45:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:55,004 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-11-23 15:45:55,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-11-23 15:45:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 15:45:55,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:55,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:55,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 15:45:55,005 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:55,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 644422841, now seen corresponding path program 1 times [2023-11-23 15:45:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354244020] [2023-11-23 15:45:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 15:45:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354244020] [2023-11-23 15:45:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354244020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 15:45:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025297265] [2023-11-23 15:45:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:55,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 15:45:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:55,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 15:45:55,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:45:55,175 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:55,375 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2023-11-23 15:45:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 15:45:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-23 15:45:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:55,377 INFO L225 Difference]: With dead ends: 108 [2023-11-23 15:45:55,377 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 15:45:55,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:45:55,377 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:55,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 296 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:45:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 15:45:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2023-11-23 15:45:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 79 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2023-11-23 15:45:55,381 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 28 [2023-11-23 15:45:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:55,381 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2023-11-23 15:45:55,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2023-11-23 15:45:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 15:45:55,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:55,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 15:45:55,382 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:55,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 644422842, now seen corresponding path program 1 times [2023-11-23 15:45:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505339157] [2023-11-23 15:45:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505339157] [2023-11-23 15:45:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505339157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:55,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 15:45:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730703715] [2023-11-23 15:45:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 15:45:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 15:45:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:45:55,684 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:55,871 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2023-11-23 15:45:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:45:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-23 15:45:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:55,872 INFO L225 Difference]: With dead ends: 85 [2023-11-23 15:45:55,872 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 15:45:55,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:45:55,873 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 61 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:55,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 324 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:45:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 15:45:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-23 15:45:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.631578947368421) internal successors, (93), 79 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-11-23 15:45:55,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 28 [2023-11-23 15:45:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:55,876 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-11-23 15:45:55,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-11-23 15:45:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 15:45:55,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:55,876 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:55,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 15:45:55,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:55,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 815257392, now seen corresponding path program 1 times [2023-11-23 15:45:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284228189] [2023-11-23 15:45:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:45:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:55,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284228189] [2023-11-23 15:45:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284228189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:55,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:45:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797533914] [2023-11-23 15:45:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:45:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:55,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:45:55,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:45:55,967 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:56,052 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2023-11-23 15:45:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:45:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-23 15:45:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:56,054 INFO L225 Difference]: With dead ends: 125 [2023-11-23 15:45:56,054 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 15:45:56,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:45:56,056 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:56,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 200 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 15:45:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2023-11-23 15:45:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 81 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2023-11-23 15:45:56,060 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 30 [2023-11-23 15:45:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:56,060 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2023-11-23 15:45:56,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2023-11-23 15:45:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 15:45:56,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:56,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:45:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 15:45:56,064 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:56,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 813827583, now seen corresponding path program 1 times [2023-11-23 15:45:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027842448] [2023-11-23 15:45:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:45:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:56,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027842448] [2023-11-23 15:45:56,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027842448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:45:56,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:45:56,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:45:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17998599] [2023-11-23 15:45:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:45:56,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:45:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:45:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:45:56,164 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:56,234 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2023-11-23 15:45:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:45:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-23 15:45:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:56,236 INFO L225 Difference]: With dead ends: 100 [2023-11-23 15:45:56,236 INFO L226 Difference]: Without dead ends: 100 [2023-11-23 15:45:56,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:45:56,237 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 84 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:56,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:45:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-23 15:45:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-11-23 15:45:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6) internal successors, (96), 82 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2023-11-23 15:45:56,241 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 30 [2023-11-23 15:45:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:56,242 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2023-11-23 15:45:56,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:45:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2023-11-23 15:45:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:45:56,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:56,243 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 15:45:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 15:45:56,243 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:45:56,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:45:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1577301811, now seen corresponding path program 1 times [2023-11-23 15:45:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:45:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630280056] [2023-11-23 15:45:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:45:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:45:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:45:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:45:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630280056] [2023-11-23 15:45:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630280056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457994962] [2023-11-23 15:45:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:45:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:45:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:45:56,964 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) [2023-11-23 15:45:56,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 15:45:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:45:57,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-23 15:45:57,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:45:57,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:45:57,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:45:57,282 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 [2023-11-23 15:45:57,338 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 11 treesize of output 7 [2023-11-23 15:45:57,386 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:45:57,386 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 32 treesize of output 31 [2023-11-23 15:45:57,456 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:45:57,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-23 15:45:57,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-23 15:45:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:45:57,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:45:57,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:45:57,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:45:57,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:45:57,649 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 42 treesize of output 16 [2023-11-23 15:45:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:45:57,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:45:57,679 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int))) (or (not (= v_ArrVal_1708 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1708 .cse0))))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2023-11-23 15:45:57,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_1708 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| 8))) (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1708 .cse0))))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2023-11-23 15:45:57,719 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| 8))) (store (select .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1708 .cse1))) v_ArrVal_1708)) (= (select |c_#valid| (select (select (store .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-23 15:45:57,743 INFO L349 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2023-11-23 15:45:57,744 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 35 treesize of output 34 [2023-11-23 15:45:57,757 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1706))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_1708 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| 8))) (store (select .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1708 .cse1))))) (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2023-11-23 15:45:57,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1706))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| 8))) (store (select .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1708 .cse1))) v_ArrVal_1708))))) is different from false [2023-11-23 15:45:57,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| Int) (|ULTIMATE.start_dll_circular_update_at_~head#1.base| Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1706))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| 8))) (store (select .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1708 .cse1))) v_ArrVal_1708)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_22| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1708) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2023-11-23 15:45:57,868 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-11-23 15:45:57,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 566 treesize of output 518 [2023-11-23 15:45:57,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:45:57,896 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 1134 treesize of output 1118 [2023-11-23 15:45:57,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:57,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:57,961 INFO L349 Elim1Store]: treesize reduction 6, result has 86.7 percent of original size [2023-11-23 15:45:57,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 596 treesize of output 589 [2023-11-23 15:45:58,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,036 INFO L349 Elim1Store]: treesize reduction 6, result has 86.7 percent of original size [2023-11-23 15:45:58,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 531 treesize of output 457 [2023-11-23 15:45:58,158 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,164 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 35 treesize of output 8 [2023-11-23 15:45:58,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,220 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 35 treesize of output 8 [2023-11-23 15:45:58,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,289 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 35 treesize of output 8 [2023-11-23 15:45:58,460 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 13 treesize of output 1 [2023-11-23 15:45:58,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:45:58,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2023-11-23 15:45:58,542 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 13 treesize of output 1 [2023-11-23 15:45:58,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2023-11-23 15:45:58,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2023-11-23 15:45:58,661 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 15:45:58,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2023-11-23 15:45:58,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2023-11-23 15:45:58,871 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,874 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 0 case distinctions, treesize of input 160 treesize of output 150 [2023-11-23 15:45:58,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,952 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 0 case distinctions, treesize of input 26 treesize of output 20 [2023-11-23 15:45:58,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:58,997 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 35 treesize of output 8 [2023-11-23 15:45:59,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:59,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:45:59,018 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 0 case distinctions, treesize of input 165 treesize of output 145 [2023-11-23 15:45:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457994962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:45:59,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:45:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2023-11-23 15:45:59,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943685816] [2023-11-23 15:45:59,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:45:59,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-23 15:45:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:45:59,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-23 15:45:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=980, Unknown=6, NotChecked=402, Total=1482 [2023-11-23 15:45:59,142 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:45:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:45:59,913 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2023-11-23 15:45:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 15:45:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-11-23 15:45:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:45:59,915 INFO L225 Difference]: With dead ends: 146 [2023-11-23 15:45:59,915 INFO L226 Difference]: Without dead ends: 146 [2023-11-23 15:45:59,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1503, Unknown=6, NotChecked=498, Total=2162 [2023-11-23 15:45:59,916 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:45:59,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 811 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 15:45:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-23 15:45:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 99. [2023-11-23 15:45:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 93 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:45:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-11-23 15:45:59,920 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 33 [2023-11-23 15:45:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:45:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-11-23 15:45:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:45:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-11-23 15:45:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:45:59,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:45:59,921 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 15:45:59,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 15:46:00,137 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:00,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1577301812, now seen corresponding path program 1 times [2023-11-23 15:46:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510086955] [2023-11-23 15:46:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:00,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:46:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510086955] [2023-11-23 15:46:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510086955] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634212445] [2023-11-23 15:46:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:01,380 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) [2023-11-23 15:46:01,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 15:46:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:01,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-23 15:46:01,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:01,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:01,624 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 [2023-11-23 15:46:01,884 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:01,885 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 [2023-11-23 15:46:01,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:01,898 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 [2023-11-23 15:46:01,990 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 [2023-11-23 15:46:01,993 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 11 treesize of output 7 [2023-11-23 15:46:02,061 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:02,061 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 57 treesize of output 50 [2023-11-23 15:46:02,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-23 15:46:02,193 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:02,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 15:46:02,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 15:46:02,208 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:02,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 15:46:02,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-23 15:46:02,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:02,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:02,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:46:02,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:02,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:02,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2023-11-23 15:46:02,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 15:46:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:46:02,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:02,680 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1904 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1904)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_1903 (Array Int Int))) (or (forall ((v_ArrVal_1904 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1904)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_1903 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1903 .cse1)))))))) is different from false [2023-11-23 15:46:03,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:03,083 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 [2023-11-23 15:46:03,086 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 60 [2023-11-23 15:46:03,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2023-11-23 15:46:03,096 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 [2023-11-23 15:46:03,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:03,112 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2023-11-23 15:46:03,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:03,118 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-23 15:46:03,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:03,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:03,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-23 15:46:03,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:03,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:03,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-23 15:46:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634212445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:03,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-11-23 15:46:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558359054] [2023-11-23 15:46:03,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:03,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 15:46:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 15:46:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2028, Unknown=2, NotChecked=90, Total=2256 [2023-11-23 15:46:03,362 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 37 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:04,526 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2023-11-23 15:46:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 15:46:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-11-23 15:46:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:04,527 INFO L225 Difference]: With dead ends: 153 [2023-11-23 15:46:04,528 INFO L226 Difference]: Without dead ends: 153 [2023-11-23 15:46:04,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=234, Invalid=3074, Unknown=2, NotChecked=112, Total=3422 [2023-11-23 15:46:04,529 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 183 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:04,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1077 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 15:46:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-23 15:46:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2023-11-23 15:46:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 98 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:46:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2023-11-23 15:46:04,534 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 33 [2023-11-23 15:46:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:04,534 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2023-11-23 15:46:04,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2023-11-23 15:46:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:46:04,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:04,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:04,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:04,752 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:04,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1575872002, now seen corresponding path program 1 times [2023-11-23 15:46:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340456512] [2023-11-23 15:46:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:04,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340456512] [2023-11-23 15:46:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340456512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:04,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:46:04,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:46:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738161382] [2023-11-23 15:46:04,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:04,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 15:46:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 15:46:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:46:04,886 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:04,978 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2023-11-23 15:46:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:46:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-23 15:46:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:04,979 INFO L225 Difference]: With dead ends: 130 [2023-11-23 15:46:04,980 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 15:46:04,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:46:04,980 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:04,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 15:46:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2023-11-23 15:46:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 101 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:46:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2023-11-23 15:46:04,984 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 33 [2023-11-23 15:46:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:04,984 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2023-11-23 15:46:04,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2023-11-23 15:46:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:46:04,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:04,985 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 15:46:04,986 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:04,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1575872003, now seen corresponding path program 1 times [2023-11-23 15:46:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943008483] [2023-11-23 15:46:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943008483] [2023-11-23 15:46:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943008483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035930193] [2023-11-23 15:46:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:05,084 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) [2023-11-23 15:46:05,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 15:46:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 15:46:05,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:05,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035930193] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:05,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-23 15:46:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958581863] [2023-11-23 15:46:05,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 15:46:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 15:46:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-23 15:46:05,386 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:05,475 INFO L93 Difference]: Finished difference Result 126 states and 157 transitions. [2023-11-23 15:46:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:46:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-23 15:46:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:05,476 INFO L225 Difference]: With dead ends: 126 [2023-11-23 15:46:05,476 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 15:46:05,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-23 15:46:05,478 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 145 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:05,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 236 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 15:46:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2023-11-23 15:46:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 113 states have internal predecessors, (147), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:46:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 155 transitions. [2023-11-23 15:46:05,486 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 155 transitions. Word has length 33 [2023-11-23 15:46:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:05,486 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 155 transitions. [2023-11-23 15:46:05,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2023-11-23 15:46:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 15:46:05,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:05,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:05,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:05,700 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:05,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -142764124, now seen corresponding path program 1 times [2023-11-23 15:46:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356088026] [2023-11-23 15:46:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 15:46:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 15:46:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356088026] [2023-11-23 15:46:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356088026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603414526] [2023-11-23 15:46:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:05,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:05,808 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) [2023-11-23 15:46:05,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 15:46:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:06,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 15:46:06,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:46:06,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 15:46:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603414526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 15:46:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-23 15:46:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999232201] [2023-11-23 15:46:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:46:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:46:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:46:06,048 INFO L87 Difference]: Start difference. First operand 119 states and 155 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:06,070 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2023-11-23 15:46:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:46:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-23 15:46:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:06,072 INFO L225 Difference]: With dead ends: 95 [2023-11-23 15:46:06,072 INFO L226 Difference]: Without dead ends: 95 [2023-11-23 15:46:06,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:46:06,073 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:06,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:46:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-23 15:46:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-23 15:46:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 91 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2023-11-23 15:46:06,080 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 34 [2023-11-23 15:46:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:06,080 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2023-11-23 15:46:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2023-11-23 15:46:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 15:46:06,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:06,081 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-23 15:46:06,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:06,300 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:06,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -336217302, now seen corresponding path program 2 times [2023-11-23 15:46:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708438029] [2023-11-23 15:46:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:06,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:06,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708438029] [2023-11-23 15:46:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708438029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:06,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960295102] [2023-11-23 15:46:06,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:46:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:06,423 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) [2023-11-23 15:46:06,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 15:46:06,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:46:06,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:46:06,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 15:46:06,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 15:46:06,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 15:46:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960295102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:06,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-11-23 15:46:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12177946] [2023-11-23 15:46:06,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:06,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:46:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:46:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:46:06,797 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:06,898 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2023-11-23 15:46:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:46:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-23 15:46:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:06,899 INFO L225 Difference]: With dead ends: 91 [2023-11-23 15:46:06,899 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 15:46:06,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:46:06,900 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:06,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 217 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 15:46:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2023-11-23 15:46:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.5625) internal successors, (100), 80 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2023-11-23 15:46:06,903 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 35 [2023-11-23 15:46:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:06,903 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2023-11-23 15:46:06,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2023-11-23 15:46:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 15:46:06,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:06,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:06,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:07,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-23 15:46:07,122 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:07,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 444031776, now seen corresponding path program 2 times [2023-11-23 15:46:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875210027] [2023-11-23 15:46:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875210027] [2023-11-23 15:46:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875210027] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636347336] [2023-11-23 15:46:07,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:46:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:07,236 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) [2023-11-23 15:46:07,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 15:46:07,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 15:46:07,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:46:07,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 15:46:07,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:07,474 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 [2023-11-23 15:46:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:46:07,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 15:46:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636347336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 15:46:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2023-11-23 15:46:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397303299] [2023-11-23 15:46:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:07,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 15:46:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 15:46:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:46:07,612 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:07,751 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-11-23 15:46:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:46:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-23 15:46:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:07,752 INFO L225 Difference]: With dead ends: 84 [2023-11-23 15:46:07,752 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 15:46:07,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-23 15:46:07,753 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:07,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 269 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 15:46:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-23 15:46:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.5) internal successors, (96), 80 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2023-11-23 15:46:07,755 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 36 [2023-11-23 15:46:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:07,755 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2023-11-23 15:46:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2023-11-23 15:46:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 15:46:07,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:07,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:07,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:07,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-23 15:46:07,956 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:07,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1512927239, now seen corresponding path program 1 times [2023-11-23 15:46:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831882771] [2023-11-23 15:46:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 15:46:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831882771] [2023-11-23 15:46:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831882771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:08,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:46:08,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:46:08,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901142745] [2023-11-23 15:46:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:08,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:46:08,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:08,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:46:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:46:08,048 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:08,117 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2023-11-23 15:46:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:46:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2023-11-23 15:46:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:08,119 INFO L225 Difference]: With dead ends: 83 [2023-11-23 15:46:08,119 INFO L226 Difference]: Without dead ends: 83 [2023-11-23 15:46:08,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:46:08,120 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:08,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 184 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-23 15:46:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-11-23 15:46:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 76 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-11-23 15:46:08,123 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 38 [2023-11-23 15:46:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:08,123 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-11-23 15:46:08,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-11-23 15:46:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 15:46:08,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:08,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:08,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 15:46:08,125 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:08,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1898486009, now seen corresponding path program 3 times [2023-11-23 15:46:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935653817] [2023-11-23 15:46:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 15:46:08,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935653817] [2023-11-23 15:46:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935653817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578916990] [2023-11-23 15:46:08,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 15:46:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:08,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:08,260 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) [2023-11-23 15:46:08,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 15:46:08,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-23 15:46:08,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:46:08,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 15:46:08,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 15:46:08,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 15:46:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578916990] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:08,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-11-23 15:46:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044189131] [2023-11-23 15:46:08,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:08,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 15:46:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 15:46:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:46:08,978 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:09,086 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2023-11-23 15:46:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:46:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-11-23 15:46:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:09,087 INFO L225 Difference]: With dead ends: 76 [2023-11-23 15:46:09,087 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 15:46:09,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:46:09,088 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 77 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:09,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 15:46:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-11-23 15:46:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2023-11-23 15:46:09,092 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 38 [2023-11-23 15:46:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:09,092 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2023-11-23 15:46:09,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2023-11-23 15:46:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 15:46:09,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:09,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:09,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:09,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-23 15:46:09,300 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:09,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2024786435, now seen corresponding path program 1 times [2023-11-23 15:46:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846565414] [2023-11-23 15:46:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:46:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846565414] [2023-11-23 15:46:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846565414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346955063] [2023-11-23 15:46:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:10,692 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) [2023-11-23 15:46:10,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 15:46:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:10,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 93 conjunts are in the unsatisfiable core [2023-11-23 15:46:10,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:11,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:11,157 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:11,157 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 [2023-11-23 15:46:11,215 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 11 treesize of output 7 [2023-11-23 15:46:11,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:11,262 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 32 treesize of output 31 [2023-11-23 15:46:11,352 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:11,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-23 15:46:11,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 15:46:11,475 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 [2023-11-23 15:46:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2023-11-23 15:46:11,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-23 15:46:11,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-23 15:46:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:46:11,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:12,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:12,053 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 29 treesize of output 30 [2023-11-23 15:46:12,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:12,061 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 50 treesize of output 49 [2023-11-23 15:46:12,065 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 18 treesize of output 14 [2023-11-23 15:46:12,283 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3291) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2023-11-23 15:46:12,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:12,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-23 15:46:12,981 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 65 treesize of output 57 [2023-11-23 15:46:12,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 15:46:12,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 15:46:12,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 15:46:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:46:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346955063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:13,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:13,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 63 [2023-11-23 15:46:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968445092] [2023-11-23 15:46:13,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:13,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-23 15:46:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:13,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-23 15:46:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3509, Unknown=72, NotChecked=120, Total=3906 [2023-11-23 15:46:13,340 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 63 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 15:46:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:14,729 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-11-23 15:46:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 15:46:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-11-23 15:46:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:14,730 INFO L225 Difference]: With dead ends: 73 [2023-11-23 15:46:14,730 INFO L226 Difference]: Without dead ends: 73 [2023-11-23 15:46:14,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=384, Invalid=5399, Unknown=73, NotChecked=150, Total=6006 [2023-11-23 15:46:14,732 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 163 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:14,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1352 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1215 Invalid, 0 Unknown, 69 Unchecked, 0.8s Time] [2023-11-23 15:46:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-23 15:46:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-23 15:46:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-11-23 15:46:14,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 41 [2023-11-23 15:46:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-11-23 15:46:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 15:46:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-11-23 15:46:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 15:46:14,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:14,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:14,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:14,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-23 15:46:14,955 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:14,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1759839686, now seen corresponding path program 1 times [2023-11-23 15:46:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768114704] [2023-11-23 15:46:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 15:46:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768114704] [2023-11-23 15:46:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768114704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18133141] [2023-11-23 15:46:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:15,875 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) [2023-11-23 15:46:15,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 15:46:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:16,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-23 15:46:16,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:16,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:16,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:16,255 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 [2023-11-23 15:46:16,305 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 11 treesize of output 7 [2023-11-23 15:46:16,338 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 [2023-11-23 15:46:16,395 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 [2023-11-23 15:46:16,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-23 15:46:16,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:16,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:16,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:16,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2023-11-23 15:46:16,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:16,639 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 47 treesize of output 42 [2023-11-23 15:46:16,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:16,709 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 38 treesize of output 16 [2023-11-23 15:46:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 15:46:16,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:16,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3497 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2023-11-23 15:46:16,844 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (or (not (= v_ArrVal_3496 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3496 .cse0))))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3496))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3497)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2023-11-23 15:46:16,862 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (or (not (= v_ArrVal_3496 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3496 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3496) (select v_ArrVal_3496 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-23 15:46:16,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3496) (select v_ArrVal_3496 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_3496 .cse0))) v_ArrVal_3496)))) is different from false [2023-11-23 15:46:16,887 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-23 15:46:16,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 27 treesize of output 26 [2023-11-23 15:46:16,896 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3494 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3494))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3496) (select v_ArrVal_3496 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_3496 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3496 .cse1)))))))) is different from false [2023-11-23 15:46:16,920 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3494 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3494))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3496) (select v_ArrVal_3496 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_3496 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3496 .cse1)))))))) is different from false [2023-11-23 15:46:16,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| Int) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3493) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3494))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3496) (select v_ArrVal_3496 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3497) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_45| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3496 .cse1))) v_ArrVal_3496))))) is different from false [2023-11-23 15:46:16,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:16,960 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 58 treesize of output 58 [2023-11-23 15:46:16,964 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 227 treesize of output 221 [2023-11-23 15:46:16,982 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:16,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:16,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2023-11-23 15:46:16,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2023-11-23 15:46:17,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:17,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2023-11-23 15:46:17,042 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 11 treesize of output 9 [2023-11-23 15:46:17,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 120 [2023-11-23 15:46:17,170 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,171 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-11-23 15:46:17,183 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 8 treesize of output 4 [2023-11-23 15:46:17,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18133141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:17,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 36 [2023-11-23 15:46:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658259236] [2023-11-23 15:46:17,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:17,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-23 15:46:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-23 15:46:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1412, Unknown=37, NotChecked=574, Total=2162 [2023-11-23 15:46:17,239 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 37 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:17,912 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2023-11-23 15:46:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 15:46:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-11-23 15:46:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:17,913 INFO L225 Difference]: With dead ends: 97 [2023-11-23 15:46:17,913 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 15:46:17,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=2037, Unknown=39, NotChecked=686, Total=2970 [2023-11-23 15:46:17,914 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 103 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:17,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 805 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 15:46:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 15:46:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2023-11-23 15:46:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-11-23 15:46:17,917 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 44 [2023-11-23 15:46:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:17,918 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-11-23 15:46:17,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.212121212121212) internal successors, (73), 32 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-11-23 15:46:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 15:46:17,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:17,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:17,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-23 15:46:18,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:18,133 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:18,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1759839687, now seen corresponding path program 1 times [2023-11-23 15:46:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192108241] [2023-11-23 15:46:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 15:46:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192108241] [2023-11-23 15:46:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192108241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265318270] [2023-11-23 15:46:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:19,462 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) [2023-11-23 15:46:19,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 15:46:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:19,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-23 15:46:19,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:19,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:19,742 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 [2023-11-23 15:46:19,993 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:19,993 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 [2023-11-23 15:46:20,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:20,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 15:46:20,087 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 [2023-11-23 15:46:20,091 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 11 treesize of output 7 [2023-11-23 15:46:20,152 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:20,152 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 57 treesize of output 50 [2023-11-23 15:46:20,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-23 15:46:20,266 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:20,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 15:46:20,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 15:46:20,283 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:20,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 15:46:20,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:20,352 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 35 treesize of output 26 [2023-11-23 15:46:20,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:20,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:20,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:46:20,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:20,650 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 67 treesize of output 58 [2023-11-23 15:46:20,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:20,660 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 [2023-11-23 15:46:20,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 16 [2023-11-23 15:46:20,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 15:46:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 15:46:20,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:20,983 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3707 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3707 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-11-23 15:46:20,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3707 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3707 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2023-11-23 15:46:21,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3707 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3707 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))) is different from false [2023-11-23 15:46:21,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3704 (Array Int Int))) (or (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3704))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3705)) .cse2 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= (store .cse4 .cse1 (select v_ArrVal_3704 .cse1)) v_ArrVal_3704)))) (forall ((v_ArrVal_3704 (Array Int Int))) (or (forall ((v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3705)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse4 .cse1 (select v_ArrVal_3704 .cse1)) v_ArrVal_3704)))))) is different from false [2023-11-23 15:46:21,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| Int) (v_DerPreprocessor_19 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_main_~s~0#1.offset|) (< 0 (+ (select (select (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 .cse1 v_ArrVal_3705)) (select (store .cse2 .cse1 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3707)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3704 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| 8))) (or (not (= (store .cse2 .cse3 (select v_ArrVal_3704 .cse3)) v_ArrVal_3704)) (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3704 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 .cse3 v_ArrVal_3705)) .cse4 v_ArrVal_3707) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3704) .cse4 v_ArrVal_3706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))))) is different from false [2023-11-23 15:46:21,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_3702 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3704 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| 8))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3704 .cse1)) v_ArrVal_3704)) (forall ((v_ArrVal_3706 (Array Int Int)) (v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3704 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse2 .cse3 v_ArrVal_3702) .cse1 v_ArrVal_3705)) .cse4 v_ArrVal_3707) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3704) .cse4 v_ArrVal_3706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))) (forall ((v_ArrVal_3705 Int) (v_ArrVal_3707 (Array Int Int)) (v_ArrVal_3702 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| Int) (v_DerPreprocessor_19 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< 0 (+ 9 (select (select (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_49| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store .cse2 .cse3 v_ArrVal_3702) .cse5 v_ArrVal_3705)) (select (store .cse0 .cse5 v_DerPreprocessor_19) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3707)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) is different from false [2023-11-23 15:46:21,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:21,798 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 94 treesize of output 94 [2023-11-23 15:46:21,807 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 196 treesize of output 192 [2023-11-23 15:46:21,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:21,819 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 338 treesize of output 338 [2023-11-23 15:46:21,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,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 111 treesize of output 109 [2023-11-23 15:46:21,835 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,838 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 89 treesize of output 85 [2023-11-23 15:46:21,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,845 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 82 treesize of output 78 [2023-11-23 15:46:21,858 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 227 treesize of output 221 [2023-11-23 15:46:21,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:21,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2023-11-23 15:46:21,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:21,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2023-11-23 15:46:21,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:21,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:21,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2023-11-23 15:46:21,926 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 17 treesize of output 15 [2023-11-23 15:46:21,937 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 15 treesize of output 13 [2023-11-23 15:46:22,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,040 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 0 case distinctions, treesize of input 140 treesize of output 116 [2023-11-23 15:46:22,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,076 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 0 case distinctions, treesize of input 71 treesize of output 55 [2023-11-23 15:46:22,095 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-23 15:46:22,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:22,119 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2023-11-23 15:46:22,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-11-23 15:46:22,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:22,135 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 82 [2023-11-23 15:46:22,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2023-11-23 15:46:22,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,147 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 44 treesize of output 38 [2023-11-23 15:46:22,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:22,152 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 [2023-11-23 15:46:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265318270] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:22,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2023-11-23 15:46:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441914623] [2023-11-23 15:46:22,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:22,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 15:46:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 15:46:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2392, Unknown=9, NotChecked=618, Total=3192 [2023-11-23 15:46:22,431 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:23,751 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-11-23 15:46:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 15:46:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2023-11-23 15:46:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:23,752 INFO L225 Difference]: With dead ends: 76 [2023-11-23 15:46:23,752 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 15:46:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=293, Invalid=3754, Unknown=9, NotChecked=774, Total=4830 [2023-11-23 15:46:23,754 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 110 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:23,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1125 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 15:46:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 15:46:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-11-23 15:46:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-11-23 15:46:23,757 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 44 [2023-11-23 15:46:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:23,757 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-11-23 15:46:23,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-11-23 15:46:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-23 15:46:23,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:23,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:23,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:23,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-23 15:46:23,968 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:23,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1281098387, now seen corresponding path program 1 times [2023-11-23 15:46:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135353258] [2023-11-23 15:46:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 15:46:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135353258] [2023-11-23 15:46:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135353258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563628913] [2023-11-23 15:46:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:24,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:24,080 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) [2023-11-23 15:46:24,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 15:46:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 15:46:24,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 15:46:24,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 15:46:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563628913] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:24,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-23 15:46:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385186100] [2023-11-23 15:46:24,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:24,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:46:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:46:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:46:24,419 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:24,506 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2023-11-23 15:46:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:46:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-23 15:46:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:24,507 INFO L225 Difference]: With dead ends: 75 [2023-11-23 15:46:24,507 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 15:46:24,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:46:24,508 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:24,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 211 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 15:46:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-23 15:46:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-11-23 15:46:24,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 45 [2023-11-23 15:46:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:24,510 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-23 15:46:24,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2023-11-23 15:46:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-23 15:46:24,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:24,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:24,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:24,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-23 15:46:24,716 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:24,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1011022610, now seen corresponding path program 2 times [2023-11-23 15:46:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474065645] [2023-11-23 15:46:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 15:46:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474065645] [2023-11-23 15:46:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474065645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826152994] [2023-11-23 15:46:24,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:46:24,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:24,828 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) [2023-11-23 15:46:24,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 15:46:25,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:46:25,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:46:25,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 15:46:25,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:46:25,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:46:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826152994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:25,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-11-23 15:46:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107140873] [2023-11-23 15:46:25,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:25,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:46:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:46:25,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:46:25,328 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:25,408 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2023-11-23 15:46:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:46:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-11-23 15:46:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:25,409 INFO L225 Difference]: With dead ends: 67 [2023-11-23 15:46:25,409 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 15:46:25,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:46:25,410 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:25,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 164 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 15:46:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-23 15:46:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.25) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2023-11-23 15:46:25,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 46 [2023-11-23 15:46:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:25,413 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2023-11-23 15:46:25,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2023-11-23 15:46:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 15:46:25,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:25,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:25,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:25,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:25,628 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:25,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1278483643, now seen corresponding path program 1 times [2023-11-23 15:46:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860712855] [2023-11-23 15:46:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:46:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860712855] [2023-11-23 15:46:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860712855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273671432] [2023-11-23 15:46:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:27,170 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:27,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 15:46:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:27,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-23 15:46:27,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:27,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:27,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:27,716 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 [2023-11-23 15:46:27,789 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 11 treesize of output 7 [2023-11-23 15:46:27,856 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:27,856 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 32 treesize of output 31 [2023-11-23 15:46:27,957 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:27,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-23 15:46:27,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 15:46:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:28,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:28,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:28,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2023-11-23 15:46:28,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:28,283 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 79 treesize of output 68 [2023-11-23 15:46:28,287 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 25 treesize of output 17 [2023-11-23 15:46:28,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-23 15:46:28,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2023-11-23 15:46:28,578 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 13 [2023-11-23 15:46:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:46:28,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:28,925 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 76 treesize of output 56 [2023-11-23 15:46:28,935 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4297) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4295) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) is different from false [2023-11-23 15:46:28,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:28,952 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 38 treesize of output 37 [2023-11-23 15:46:28,955 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 13 treesize of output 11 [2023-11-23 15:46:29,091 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4293 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4293) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_4293 .cse0))) v_ArrVal_4293)))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-11-23 15:46:29,297 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| Int) (v_ArrVal_4291 (Array Int Int)) (v_DerPreprocessor_21 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4291) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| 8) v_DerPreprocessor_21) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-23 15:46:29,312 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| Int) (v_ArrVal_4291 (Array Int Int)) (v_DerPreprocessor_21 Int)) (or (not (= (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4291) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| 8) v_DerPreprocessor_21) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-23 15:46:29,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_DerPreprocessor_21 Int)) (or (not (= (select (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4290) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4291) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| 8) v_DerPreprocessor_21) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_58| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-23 15:46:29,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:29,340 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 32 treesize of output 33 [2023-11-23 15:46:29,343 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 211 treesize of output 205 [2023-11-23 15:46:29,347 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:29,348 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 91 treesize of output 87 [2023-11-23 15:46:29,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:29,352 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 62 treesize of output 60 [2023-11-23 15:46:29,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:29,360 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 36 [2023-11-23 15:46:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-23 15:46:29,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273671432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:29,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:29,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 72 [2023-11-23 15:46:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306667005] [2023-11-23 15:46:29,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:29,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-23 15:46:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-23 15:46:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4222, Unknown=5, NotChecked=670, Total=5112 [2023-11-23 15:46:29,779 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 72 states, 66 states have (on average 1.803030303030303) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 15:46:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:31,620 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-11-23 15:46:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 15:46:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 66 states have (on average 1.803030303030303) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2023-11-23 15:46:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:31,621 INFO L225 Difference]: With dead ends: 64 [2023-11-23 15:46:31,621 INFO L226 Difference]: Without dead ends: 64 [2023-11-23 15:46:31,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=425, Invalid=7072, Unknown=5, NotChecked=870, Total=8372 [2023-11-23 15:46:31,635 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 121 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:31,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1322 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1394 Invalid, 0 Unknown, 307 Unchecked, 0.8s Time] [2023-11-23 15:46:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-23 15:46:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-23 15:46:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.24) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2023-11-23 15:46:31,637 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 47 [2023-11-23 15:46:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:31,637 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2023-11-23 15:46:31,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 66 states have (on average 1.803030303030303) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 15:46:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2023-11-23 15:46:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 15:46:31,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:31,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:31,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-23 15:46:31,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:31,844 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:31,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -266435737, now seen corresponding path program 1 times [2023-11-23 15:46:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178461783] [2023-11-23 15:46:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 15:46:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178461783] [2023-11-23 15:46:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178461783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273704727] [2023-11-23 15:46:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:31,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:31,954 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:31,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-23 15:46:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:32,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-23 15:46:32,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:32,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 15:46:32,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 15:46:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273704727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:32,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 15:46:32,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 10 [2023-11-23 15:46:32,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633943385] [2023-11-23 15:46:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:32,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 15:46:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:32,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 15:46:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 15:46:32,397 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:32,533 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2023-11-23 15:46:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:46:32,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-11-23 15:46:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:32,535 INFO L225 Difference]: With dead ends: 81 [2023-11-23 15:46:32,535 INFO L226 Difference]: Without dead ends: 81 [2023-11-23 15:46:32,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 15:46:32,535 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:32,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 164 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-23 15:46:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-11-23 15:46:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-11-23 15:46:32,538 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 49 [2023-11-23 15:46:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:32,538 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-11-23 15:46:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-11-23 15:46:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 15:46:32,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:32,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:32,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:32,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:32,748 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:32,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -266435736, now seen corresponding path program 1 times [2023-11-23 15:46:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217286410] [2023-11-23 15:46:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 15:46:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217286410] [2023-11-23 15:46:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217286410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:46:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 15:46:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664143757] [2023-11-23 15:46:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:33,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 15:46:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:33,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 15:46:33,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:46:33,048 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:33,227 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2023-11-23 15:46:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:46:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-11-23 15:46:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:33,228 INFO L225 Difference]: With dead ends: 65 [2023-11-23 15:46:33,229 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 15:46:33,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:46:33,229 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:33,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 166 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 15:46:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-23 15:46:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-11-23 15:46:33,231 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 49 [2023-11-23 15:46:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:33,231 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-11-23 15:46:33,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-11-23 15:46:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-23 15:46:33,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:33,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:33,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-23 15:46:33,232 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:33,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 330460641, now seen corresponding path program 1 times [2023-11-23 15:46:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:33,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270835995] [2023-11-23 15:46:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 15:46:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270835995] [2023-11-23 15:46:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270835995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:46:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 15:46:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748681603] [2023-11-23 15:46:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:33,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 15:46:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 15:46:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:46:33,409 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:33,524 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-23 15:46:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:46:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2023-11-23 15:46:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:33,525 INFO L225 Difference]: With dead ends: 65 [2023-11-23 15:46:33,525 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 15:46:33,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:46:33,526 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:33,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 194 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 15:46:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-23 15:46:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-23 15:46:33,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 50 [2023-11-23 15:46:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-23 15:46:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-23 15:46:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 15:46:33,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:33,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:33,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-23 15:46:33,530 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:33,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1653380414, now seen corresponding path program 1 times [2023-11-23 15:46:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433087564] [2023-11-23 15:46:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:46:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433087564] [2023-11-23 15:46:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433087564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705274419] [2023-11-23 15:46:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:33,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:33,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:33,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:33,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-23 15:46:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:34,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-23 15:46:34,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:34,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:34,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:34,159 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 [2023-11-23 15:46:34,197 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 11 treesize of output 7 [2023-11-23 15:46:34,245 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:34,245 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 32 treesize of output 31 [2023-11-23 15:46:34,307 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:34,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-23 15:46:34,336 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 35 treesize of output 26 [2023-11-23 15:46:34,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:34,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:34,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:34,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:46:34,556 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:34,557 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 51 treesize of output 46 [2023-11-23 15:46:34,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:34,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-23 15:46:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 15:46:34,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:35,095 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-11-23 15:46:35,096 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 27 treesize of output 26 [2023-11-23 15:46:35,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:35,342 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 58 treesize of output 58 [2023-11-23 15:46:35,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2023-11-23 15:46:35,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:35,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2023-11-23 15:46:35,368 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:35,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2023-11-23 15:46:35,381 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:35,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2023-11-23 15:46:35,397 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 11 treesize of output 9 [2023-11-23 15:46:35,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,466 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2023-11-23 15:46:35,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:35,500 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 0 case distinctions, treesize of input 92 treesize of output 72 [2023-11-23 15:46:35,517 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 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-23 15:46:35,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705274419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:35,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:35,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 25 [2023-11-23 15:46:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420906774] [2023-11-23 15:46:35,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 15:46:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 15:46:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1417, Unknown=23, NotChecked=0, Total=1560 [2023-11-23 15:46:35,682 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:36,193 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2023-11-23 15:46:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 15:46:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2023-11-23 15:46:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:36,194 INFO L225 Difference]: With dead ends: 73 [2023-11-23 15:46:36,195 INFO L226 Difference]: Without dead ends: 73 [2023-11-23 15:46:36,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1960, Unknown=23, NotChecked=0, Total=2162 [2023-11-23 15:46:36,196 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:36,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 335 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 15:46:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-23 15:46:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2023-11-23 15:46:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-11-23 15:46:36,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 51 [2023-11-23 15:46:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:36,198 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-11-23 15:46:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 15:46:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-11-23 15:46:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-23 15:46:36,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:36,198 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:36,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:36,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-23 15:46:36,399 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:36,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1653380415, now seen corresponding path program 1 times [2023-11-23 15:46:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774166801] [2023-11-23 15:46:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 15:46:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774166801] [2023-11-23 15:46:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774166801] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539586020] [2023-11-23 15:46:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:37,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:37,465 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:37,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-23 15:46:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:37,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-23 15:46:37,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:37,820 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 [2023-11-23 15:46:37,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:38,064 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:38,064 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 [2023-11-23 15:46:38,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:38,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 11 treesize of output 11 [2023-11-23 15:46:38,180 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 [2023-11-23 15:46:38,192 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 11 treesize of output 7 [2023-11-23 15:46:38,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:38,286 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 57 treesize of output 50 [2023-11-23 15:46:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-23 15:46:38,413 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:46:38,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 15:46:38,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 15:46:38,426 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:38,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 15:46:38,490 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 35 treesize of output 26 [2023-11-23 15:46:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:38,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:38,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 15:46:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:38,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:46:38,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:38,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 67 treesize of output 58 [2023-11-23 15:46:38,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-23 15:46:39,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-23 15:46:39,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 15:46:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 15:46:39,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:40,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,709 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 94 treesize of output 94 [2023-11-23 15:46:40,717 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 196 treesize of output 192 [2023-11-23 15:46:40,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,726 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 338 treesize of output 338 [2023-11-23 15:46:40,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,735 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 101 treesize of output 97 [2023-11-23 15:46:40,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,742 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 87 treesize of output 85 [2023-11-23 15:46:40,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,749 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 82 treesize of output 78 [2023-11-23 15:46:40,759 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 113 treesize of output 109 [2023-11-23 15:46:40,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2023-11-23 15:46:40,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2023-11-23 15:46:40,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2023-11-23 15:46:40,821 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 17 treesize of output 15 [2023-11-23 15:46:40,831 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 15 treesize of output 13 [2023-11-23 15:46:40,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,924 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 0 case distinctions, treesize of input 135 treesize of output 107 [2023-11-23 15:46:40,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,951 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 0 case distinctions, treesize of input 69 treesize of output 53 [2023-11-23 15:46:40,961 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-23 15:46:40,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,974 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2023-11-23 15:46:40,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-11-23 15:46:40,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:40,987 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-11-23 15:46:40,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,990 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2023-11-23 15:46:40,994 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:40,996 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 34 [2023-11-23 15:46:40,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:41,001 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 [2023-11-23 15:46:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539586020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:41,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 43 [2023-11-23 15:46:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124580614] [2023-11-23 15:46:41,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:41,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-23 15:46:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-23 15:46:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3230, Unknown=15, NotChecked=0, Total=3422 [2023-11-23 15:46:41,270 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:42,568 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-11-23 15:46:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 15:46:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2023-11-23 15:46:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:42,569 INFO L225 Difference]: With dead ends: 70 [2023-11-23 15:46:42,569 INFO L226 Difference]: Without dead ends: 70 [2023-11-23 15:46:42,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=343, Invalid=5192, Unknown=15, NotChecked=0, Total=5550 [2023-11-23 15:46:42,570 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 222 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:42,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 492 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 15:46:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-23 15:46:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2023-11-23 15:46:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-11-23 15:46:42,573 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 51 [2023-11-23 15:46:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:42,573 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-11-23 15:46:42,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.282051282051282) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-11-23 15:46:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 15:46:42,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:42,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:42,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:42,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-23 15:46:42,788 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:42,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -284816089, now seen corresponding path program 1 times [2023-11-23 15:46:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037484142] [2023-11-23 15:46:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 15:46:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037484142] [2023-11-23 15:46:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037484142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:46:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:46:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 15:46:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028949686] [2023-11-23 15:46:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:46:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 15:46:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 15:46:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:46:42,953 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 10 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:43,104 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-11-23 15:46:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 15:46:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2023-11-23 15:46:43,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:43,105 INFO L225 Difference]: With dead ends: 65 [2023-11-23 15:46:43,105 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 15:46:43,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:46:43,106 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:43,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 161 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:46:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 15:46:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-23 15:46:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.125) internal successors, (63), 61 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2023-11-23 15:46:43,108 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 52 [2023-11-23 15:46:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:43,109 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2023-11-23 15:46:43,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 15:46:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2023-11-23 15:46:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 15:46:43,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:43,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:43,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-23 15:46:43,110 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:43,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash -239258628, now seen corresponding path program 1 times [2023-11-23 15:46:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302330081] [2023-11-23 15:46:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302330081] [2023-11-23 15:46:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302330081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248493580] [2023-11-23 15:46:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:43,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:43,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:43,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-23 15:46:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:44,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-23 15:46:44,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:44,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 15:46:44,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:44,421 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 [2023-11-23 15:46:44,486 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 11 treesize of output 7 [2023-11-23 15:46:44,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:44,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-23 15:46:44,619 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:44,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 15:46:44,631 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 35 treesize of output 26 [2023-11-23 15:46:44,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:44,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:44,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:44,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2023-11-23 15:46:44,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:44,876 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 51 treesize of output 46 [2023-11-23 15:46:44,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:44,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-11-23 15:46:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 15:46:45,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:45,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:45,792 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 58 treesize of output 58 [2023-11-23 15:46:45,795 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 113 treesize of output 109 [2023-11-23 15:46:45,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:45,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2023-11-23 15:46:45,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:45,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2023-11-23 15:46:45,836 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:45,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2023-11-23 15:46:45,852 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 13 treesize of output 11 [2023-11-23 15:46:45,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 160 [2023-11-23 15:46:45,984 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:45,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2023-11-23 15:46:46,015 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 0 case distinctions, treesize of input 63 treesize of output 51 [2023-11-23 15:46:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248493580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:46,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:46:46,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 38 [2023-11-23 15:46:46,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605099576] [2023-11-23 15:46:46,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:46,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 15:46:46,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 15:46:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2645, Unknown=17, NotChecked=0, Total=2862 [2023-11-23 15:46:46,204 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 39 states, 35 states have (on average 2.4) internal successors, (84), 34 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:47,131 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2023-11-23 15:46:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 15:46:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.4) internal successors, (84), 34 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2023-11-23 15:46:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:47,132 INFO L225 Difference]: With dead ends: 67 [2023-11-23 15:46:47,132 INFO L226 Difference]: Without dead ends: 67 [2023-11-23 15:46:47,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=4053, Unknown=17, NotChecked=0, Total=4422 [2023-11-23 15:46:47,133 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 189 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:47,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 402 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 15:46:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-23 15:46:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-11-23 15:46:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2023-11-23 15:46:47,136 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 53 [2023-11-23 15:46:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:47,137 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2023-11-23 15:46:47,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.4) internal successors, (84), 34 states have internal predecessors, (84), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:46:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2023-11-23 15:46:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-23 15:46:47,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:47,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:47,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-23 15:46:47,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-23 15:46:47,352 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:47,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1899449372, now seen corresponding path program 1 times [2023-11-23 15:46:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:47,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705164091] [2023-11-23 15:46:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 15:46:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705164091] [2023-11-23 15:46:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705164091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:48,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113099341] [2023-11-23 15:46:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:48,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:48,045 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:48,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-23 15:46:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:48,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-23 15:46:48,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:48,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:48,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:48,451 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 [2023-11-23 15:46:48,483 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 11 treesize of output 7 [2023-11-23 15:46:48,537 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:48,538 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 32 treesize of output 31 [2023-11-23 15:46:48,601 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:46:48,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-23 15:46:48,608 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 19 [2023-11-23 15:46:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:48,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:48,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:48,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-23 15:46:48,812 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:48,812 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 36 treesize of output 33 [2023-11-23 15:46:48,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:48,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2023-11-23 15:46:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 15:46:48,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:46:49,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5657 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2023-11-23 15:46:49,194 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_5656 .cse0))) v_ArrVal_5656)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5656))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5657)) |c_ULTIMATE.start_main_~s~0#1.base|) 0))))) is different from false [2023-11-23 15:46:49,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| Int)) (or (not (= v_ArrVal_5656 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_5656 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5656) (select v_ArrVal_5656 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2023-11-23 15:46:49,227 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5656) (select v_ArrVal_5656 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| 8))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_5656 .cse0))) v_ArrVal_5656)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2023-11-23 15:46:49,239 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5654))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5656 .cse1))) v_ArrVal_5656)) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5656) (select v_ArrVal_5656 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-23 15:46:49,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5654))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5656) (select v_ArrVal_5656 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_5656 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5656 .cse1)))))))) is different from false [2023-11-23 15:46:49,274 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5657 (Array Int Int)) (v_ArrVal_5656 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5653) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5654))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_5656) (select v_ArrVal_5656 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5657) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (not (= v_ArrVal_5656 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_74| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_5656 .cse1)))))))) is different from false [2023-11-23 15:46:49,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-11-23 15:46:49,299 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 227 treesize of output 221 [2023-11-23 15:46:49,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2023-11-23 15:46:49,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 105 [2023-11-23 15:46:49,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2023-11-23 15:46:49,357 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 [2023-11-23 15:46:49,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 182 [2023-11-23 15:46:49,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,601 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:49,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 201 [2023-11-23 15:46:49,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:49,789 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 54 treesize of output 64 [2023-11-23 15:46:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2023-11-23 15:46:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113099341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:46:50,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:46:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 58 [2023-11-23 15:46:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089277669] [2023-11-23 15:46:50,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:46:50,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-23 15:46:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:46:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-23 15:46:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2383, Unknown=26, NotChecked=728, Total=3306 [2023-11-23 15:46:50,357 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 58 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 51 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:46:51,355 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2023-11-23 15:46:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 15:46:51,356 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 51 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2023-11-23 15:46:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:46:51,357 INFO L225 Difference]: With dead ends: 64 [2023-11-23 15:46:51,357 INFO L226 Difference]: Without dead ends: 64 [2023-11-23 15:46:51,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=277, Invalid=3507, Unknown=26, NotChecked=882, Total=4692 [2023-11-23 15:46:51,358 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:46:51,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 516 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 960 Invalid, 0 Unknown, 403 Unchecked, 0.5s Time] [2023-11-23 15:46:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-23 15:46:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2023-11-23 15:46:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 59 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 15:46:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2023-11-23 15:46:51,361 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 55 [2023-11-23 15:46:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:46:51,361 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2023-11-23 15:46:51,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 51 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-23 15:46:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2023-11-23 15:46:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 15:46:51,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:46:51,362 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:46:51,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-23 15:46:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:51,564 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-11-23 15:46:51,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:46:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1892095091, now seen corresponding path program 1 times [2023-11-23 15:46:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:46:51,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942377250] [2023-11-23 15:46:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:46:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 15:46:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:52,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 15:46:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 15:46:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:46:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942377250] [2023-11-23 15:46:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942377250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:46:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255120494] [2023-11-23 15:46:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:46:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:46:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:46:53,009 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:46:53,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-23 15:46:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:46:53,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-23 15:46:53,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:46:53,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 15:46:53,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:46:53,508 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 [2023-11-23 15:46:53,580 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 11 treesize of output 7 [2023-11-23 15:46:53,588 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 11 treesize of output 7 [2023-11-23 15:46:53,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:46:53,646 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 48 treesize of output 43 [2023-11-23 15:46:53,648 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 [2023-11-23 15:46:53,742 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-23 15:46:53,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-23 15:46:53,755 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-23 15:46:53,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-11-23 15:46:53,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:53,812 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-11-23 15:46:53,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 83 [2023-11-23 15:46:53,822 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-23 15:46:53,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 61 [2023-11-23 15:46:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:53,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2023-11-23 15:46:53,996 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-11-23 15:46:53,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2023-11-23 15:46:54,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:54,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:54,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:54,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2023-11-23 15:46:54,259 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-11-23 15:46:54,259 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 53 [2023-11-23 15:46:54,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:46:54,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:46:54,816 INFO L349 Elim1Store]: treesize reduction 71, result has 14.5 percent of original size [2023-11-23 15:46:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 52 [2023-11-23 15:46:54,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:46:54,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 15:46:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 15:46:54,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:47:47,518 INFO L349 Elim1Store]: treesize reduction 155, result has 48.0 percent of original size [2023-11-23 15:47:47,518 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 469025 treesize of output 417951 [2023-11-23 15:47:47,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:47:47,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26027 treesize of output 25497 [2023-11-23 15:47:48,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:48,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:48,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:48,539 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 0 case distinctions, treesize of input 27329 treesize of output 26713 [2023-11-23 15:47:49,902 INFO L349 Elim1Store]: treesize reduction 17, result has 67.3 percent of original size [2023-11-23 15:47:49,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 23408 treesize of output 23266 [2023-11-23 15:47:51,951 INFO L349 Elim1Store]: treesize reduction 86, result has 66.4 percent of original size [2023-11-23 15:47:51,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 49268 treesize of output 48210 [2023-11-23 15:47:54,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:54,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:54,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:47:55,624 INFO L349 Elim1Store]: treesize reduction 285, result has 35.4 percent of original size [2023-11-23 15:47:55,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 34800 treesize of output 33961 [2023-11-23 15:48:19,047 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 13 treesize of output 1 [2023-11-23 15:48:19,759 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 13 treesize of output 1 [2023-11-23 15:48:20,066 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 13 treesize of output 1 Killed by 15