./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:53:56,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:53:56,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:53:56,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:53:56,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:53:56,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:53:56,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:53:56,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:53:56,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:53:56,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:53:56,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:53:56,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:53:56,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:53:56,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:53:56,181 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:53:56,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:53:56,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:53:56,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:53:56,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:53:56,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:53:56,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:53:56,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:53:56,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:53:56,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:53:56,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:53:56,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:53:56,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:53:56,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:53:56,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:53:56,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:53:56,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:53:56,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:53:56,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:53:56,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:53:56,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:53:56,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:53:56,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:53:56,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:53:56,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:53:56,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:53:56,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:53:56,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:53:56,198 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 ! call(reach_error())) ) 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2024-10-14 01:53:56,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:53:56,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:53:56,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:53:56,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:53:56,503 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:53:56,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-10-14 01:53:57,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:53:58,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:53:58,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-10-14 01:53:58,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c67dd5b/9f27cac7a54b4d23896963fb96e7b3ef/FLAG8b13067d8 [2024-10-14 01:53:58,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c67dd5b/9f27cac7a54b4d23896963fb96e7b3ef [2024-10-14 01:53:58,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:53:58,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:53:58,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:53:58,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:53:58,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:53:58,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:58,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788611cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58, skipping insertion in model container [2024-10-14 01:53:58,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:58,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:53:58,883 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2024-10-14 01:53:58,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:53:58,896 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:53:58,955 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2024-10-14 01:53:58,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:53:58,987 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:53:58,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58 WrapperNode [2024-10-14 01:53:58,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:53:58,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:53:58,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:53:58,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:53:58,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,037 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2024-10-14 01:53:59,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:53:59,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:53:59,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:53:59,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:53:59,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,082 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-14 01:53:59,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:53:59,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:53:59,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:53:59,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:53:59,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (1/1) ... [2024-10-14 01:53:59,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:53:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:59,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:53:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:53:59,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:53:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:53:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:53:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:53:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:53:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:53:59,301 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:53:59,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:53:59,479 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-14 01:53:59,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:53:59,511 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:53:59,511 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 01:53:59,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:59 BoogieIcfgContainer [2024-10-14 01:53:59,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:53:59,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:53:59,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:53:59,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:53:59,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:53:58" (1/3) ... [2024-10-14 01:53:59,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40627b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:59, skipping insertion in model container [2024-10-14 01:53:59,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:58" (2/3) ... [2024-10-14 01:53:59,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40627b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:59, skipping insertion in model container [2024-10-14 01:53:59,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:59" (3/3) ... [2024-10-14 01:53:59,520 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2024-10-14 01:53:59,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:53:59,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:53:59,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:53:59,595 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@69647b8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:53:59,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:53:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:53:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:53:59,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:59,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:59,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 816945935, now seen corresponding path program 1 times [2024-10-14 01:53:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987863200] [2024-10-14 01:53:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987863200] [2024-10-14 01:53:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987863200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:53:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:53:59,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:53:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842353123] [2024-10-14 01:53:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:53:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:53:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:53:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:53:59,891 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:53:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:59,958 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2024-10-14 01:53:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:53:59,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 01:53:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:59,968 INFO L225 Difference]: With dead ends: 46 [2024-10-14 01:53:59,968 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 01:53:59,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:54:00,000 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:00,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 01:54:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 01:54:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-14 01:54:00,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-10-14 01:54:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-14 01:54:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-14 01:54:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:54:00,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:00,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:00,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:54:00,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:00,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1614030004, now seen corresponding path program 1 times [2024-10-14 01:54:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:00,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124770417] [2024-10-14 01:54:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124770417] [2024-10-14 01:54:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124770417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:00,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:54:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132600670] [2024-10-14 01:54:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:54:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:54:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:00,217 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:00,270 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2024-10-14 01:54:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:54:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 01:54:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:00,272 INFO L225 Difference]: With dead ends: 34 [2024-10-14 01:54:00,272 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 01:54:00,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:54:00,274 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:00,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 01:54:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-14 01:54:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-14 01:54:00,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2024-10-14 01:54:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:00,285 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-14 01:54:00,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:54:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-14 01:54:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 01:54:00,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:00,287 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:00,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:54:00,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:00,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2105803652, now seen corresponding path program 1 times [2024-10-14 01:54:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036991016] [2024-10-14 01:54:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036991016] [2024-10-14 01:54:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036991016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:00,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:54:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095078268] [2024-10-14 01:54:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:54:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:00,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:54:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:54:00,505 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-14 01:54:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:00,586 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-14 01:54:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:54:00,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2024-10-14 01:54:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:00,588 INFO L225 Difference]: With dead ends: 37 [2024-10-14 01:54:00,588 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:54:00,589 INFO L431 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 [2024-10-14 01:54:00,590 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:00,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:54:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2024-10-14 01:54:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-14 01:54:00,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 21 [2024-10-14 01:54:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:00,601 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-14 01:54:00,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-14 01:54:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-10-14 01:54:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 01:54:00,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:00,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:00,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:54:00,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:00,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 234978919, now seen corresponding path program 1 times [2024-10-14 01:54:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:00,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014015945] [2024-10-14 01:54:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:00,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014015945] [2024-10-14 01:54:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014015945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895160583] [2024-10-14 01:54:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:00,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:00,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:00,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:00,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:54:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:00,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:54:00,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:01,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895160583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:01,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-10-14 01:54:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494081376] [2024-10-14 01:54:01,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:54:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:54:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:01,118 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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) [2024-10-14 01:54:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:01,205 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-10-14 01:54:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 24 [2024-10-14 01:54:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:01,207 INFO L225 Difference]: With dead ends: 39 [2024-10-14 01:54:01,207 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 01:54:01,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:01,210 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:01,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 01:54:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-10-14 01:54:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-14 01:54:01,220 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2024-10-14 01:54:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:01,220 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-14 01:54:01,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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) [2024-10-14 01:54:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-10-14 01:54:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 01:54:01,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:01,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:54:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:01,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1399533724, now seen corresponding path program 2 times [2024-10-14 01:54:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460299726] [2024-10-14 01:54:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460299726] [2024-10-14 01:54:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460299726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796595273] [2024-10-14 01:54:01,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:54:01,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:01,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:01,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:01,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:54:01,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:54:01,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:01,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:54:01,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:01,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:01,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796595273] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:01,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:01,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-14 01:54:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643429197] [2024-10-14 01:54:01,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:01,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:54:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:54:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:54:01,787 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-10-14 01:54:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:01,873 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-14 01:54:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 27 [2024-10-14 01:54:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:01,875 INFO L225 Difference]: With dead ends: 42 [2024-10-14 01:54:01,875 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 01:54:01,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:54:01,876 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:01,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 01:54:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-10-14 01:54:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-14 01:54:01,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 27 [2024-10-14 01:54:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:01,882 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-14 01:54:01,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-10-14 01:54:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-14 01:54:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:54:01,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:01,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:01,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:54:02,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:02,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:02,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 896199806, now seen corresponding path program 1 times [2024-10-14 01:54:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314293963] [2024-10-14 01:54:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:54:03,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314293963] [2024-10-14 01:54:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314293963] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948057651] [2024-10-14 01:54:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:03,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:03,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:03,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:54:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:03,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-14 01:54:03,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:03,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:03,711 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:54:03,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:54:03,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:03,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:54:03,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 01:54:03,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 01:54:03,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-14 01:54:04,084 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 16 treesize of output 8 [2024-10-14 01:54:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-14 01:54:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:04,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:04,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_476) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-10-14 01:54:04,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:04,619 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 [2024-10-14 01:54:04,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:04,637 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 [2024-10-14 01:54:04,647 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 [2024-10-14 01:54:04,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:04,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-14 01:54:04,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-14 01:54:04,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 01:54:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 01:54:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948057651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:05,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 52 [2024-10-14 01:54:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670330559] [2024-10-14 01:54:05,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 01:54:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 01:54:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2372, Unknown=18, NotChecked=98, Total=2652 [2024-10-14 01:54:05,262 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 52 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 43 states have internal predecessors, (66), 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) [2024-10-14 01:54:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:06,289 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2024-10-14 01:54:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 01:54:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 43 states have internal predecessors, (66), 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 28 [2024-10-14 01:54:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:06,291 INFO L225 Difference]: With dead ends: 61 [2024-10-14 01:54:06,291 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 01:54:06,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=299, Invalid=3593, Unknown=18, NotChecked=122, Total=4032 [2024-10-14 01:54:06,294 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 199 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:06,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 378 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 658 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2024-10-14 01:54:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 01:54:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2024-10-14 01:54:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-10-14 01:54:06,302 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 28 [2024-10-14 01:54:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:06,303 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-14 01:54:06,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 43 states have internal predecessors, (66), 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) [2024-10-14 01:54:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-10-14 01:54:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:54:06,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:06,304 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:06,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:54:06,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:06,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:06,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2012409567, now seen corresponding path program 1 times [2024-10-14 01:54:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917875040] [2024-10-14 01:54:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 01:54:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917875040] [2024-10-14 01:54:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917875040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:54:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:54:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531653097] [2024-10-14 01:54:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:06,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:54:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:54:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:54:06,610 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-10-14 01:54:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:06,666 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-10-14 01:54:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:54:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 29 [2024-10-14 01:54:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:06,667 INFO L225 Difference]: With dead ends: 55 [2024-10-14 01:54:06,667 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 01:54:06,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:54:06,668 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:06,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 01:54:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-10-14 01:54:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-10-14 01:54:06,681 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 29 [2024-10-14 01:54:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:06,681 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-14 01:54:06,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-10-14 01:54:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-10-14 01:54:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:54:06,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:06,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:06,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 01:54:06,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1822249764, now seen corresponding path program 2 times [2024-10-14 01:54:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883574846] [2024-10-14 01:54:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:06,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883574846] [2024-10-14 01:54:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883574846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016050478] [2024-10-14 01:54:06,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:54:06,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:06,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:06,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:06,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:54:06,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:54:06,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:06,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 01:54:06,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:06,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:54:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016050478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:07,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-10-14 01:54:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197958708] [2024-10-14 01:54:07,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:54:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:54:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:54:07,008 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-10-14 01:54:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:07,094 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2024-10-14 01:54:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 01:54:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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 29 [2024-10-14 01:54:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:07,099 INFO L225 Difference]: With dead ends: 77 [2024-10-14 01:54:07,099 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 01:54:07,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:07,100 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:07,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 66 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 01:54:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2024-10-14 01:54:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-10-14 01:54:07,115 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 29 [2024-10-14 01:54:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:07,115 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-10-14 01:54:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-10-14 01:54:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-10-14 01:54:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:54:07,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:07,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:07,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:54:07,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:07,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:07,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash -799402572, now seen corresponding path program 1 times [2024-10-14 01:54:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842075765] [2024-10-14 01:54:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 01:54:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842075765] [2024-10-14 01:54:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842075765] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227383874] [2024-10-14 01:54:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:07,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:07,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:07,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:54:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:07,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:54:07,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 01:54:07,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 01:54:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227383874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:07,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-14 01:54:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110038887] [2024-10-14 01:54:07,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:54:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:54:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:54:07,648 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2024-10-14 01:54:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:07,713 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-14 01:54:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 32 [2024-10-14 01:54:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:07,715 INFO L225 Difference]: With dead ends: 60 [2024-10-14 01:54:07,715 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 01:54:07,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:54:07,716 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:07,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 01:54:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-10-14 01:54:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-10-14 01:54:07,725 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2024-10-14 01:54:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:07,725 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-10-14 01:54:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2024-10-14 01:54:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-10-14 01:54:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 01:54:07,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:07,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:07,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:54:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:07,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 988343401, now seen corresponding path program 1 times [2024-10-14 01:54:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836798944] [2024-10-14 01:54:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:54:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836798944] [2024-10-14 01:54:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836798944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649689864] [2024-10-14 01:54:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:09,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:09,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:09,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:09,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 01:54:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-14 01:54:09,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:09,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:09,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:54:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:54:09,695 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 [2024-10-14 01:54:09,758 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:54:09,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 01:54:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:09,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-14 01:54:10,035 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:54:10,036 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 66 treesize of output 59 [2024-10-14 01:54:10,040 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 [2024-10-14 01:54:10,044 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 [2024-10-14 01:54:10,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-14 01:54:10,286 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 [2024-10-14 01:54:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:10,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:10,562 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 [2024-10-14 01:54:10,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:10,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 38 treesize of output 37 [2024-10-14 01:54:10,653 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 [2024-10-14 01:54:10,772 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_914 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_914) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_914 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_914 .cse0)))))))) is different from false [2024-10-14 01:54:10,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:54:10,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-14 01:54:10,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-14 01:54:10,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 01:54:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-14 01:54:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649689864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:11,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 60 [2024-10-14 01:54:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194465349] [2024-10-14 01:54:11,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:11,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-14 01:54:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-14 01:54:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3222, Unknown=21, NotChecked=114, Total=3540 [2024-10-14 01:54:11,242 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 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) [2024-10-14 01:54:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:12,583 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-10-14 01:54:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:54:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 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 33 [2024-10-14 01:54:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:12,585 INFO L225 Difference]: With dead ends: 82 [2024-10-14 01:54:12,585 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 01:54:12,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=350, Invalid=5333, Unknown=21, NotChecked=148, Total=5852 [2024-10-14 01:54:12,588 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:12,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 593 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1023 Invalid, 0 Unknown, 62 Unchecked, 0.6s Time] [2024-10-14 01:54:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 01:54:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2024-10-14 01:54:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-14 01:54:12,622 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 33 [2024-10-14 01:54:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:12,623 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-14 01:54:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 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) [2024-10-14 01:54:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-14 01:54:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 01:54:12,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:12,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:54:12,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:12,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2115144411, now seen corresponding path program 3 times [2024-10-14 01:54:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35130597] [2024-10-14 01:54:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:54:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35130597] [2024-10-14 01:54:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35130597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795701068] [2024-10-14 01:54:12,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:54:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:12,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:12,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 01:54:13,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 01:54:13,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:13,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:54:13,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:54:13,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:54:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795701068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:54:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:54:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-14 01:54:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972091514] [2024-10-14 01:54:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:54:13,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:54:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:54:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:13,431 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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) [2024-10-14 01:54:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:13,476 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2024-10-14 01:54:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 33 [2024-10-14 01:54:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:13,478 INFO L225 Difference]: With dead ends: 79 [2024-10-14 01:54:13,479 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 01:54:13,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:54:13,480 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:13,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 01:54:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-10-14 01:54:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:54:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-10-14 01:54:13,491 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2024-10-14 01:54:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:13,491 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-14 01:54:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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) [2024-10-14 01:54:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-10-14 01:54:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:54:13,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:13,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:13,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 01:54:13,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:13,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:13,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -132253258, now seen corresponding path program 4 times [2024-10-14 01:54:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411965422] [2024-10-14 01:54:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 01:54:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 01:54:13,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:13,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411965422] [2024-10-14 01:54:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411965422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019531735] [2024-10-14 01:54:13,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 01:54:13,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:13,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:13,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:13,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 01:54:14,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 01:54:14,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:14,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 01:54:14,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:54:14,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:54:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019531735] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:14,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2024-10-14 01:54:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140553147] [2024-10-14 01:54:14,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 01:54:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 01:54:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-14 01:54:14,360 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 01:54:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:14,472 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-14 01:54:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:54:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 34 [2024-10-14 01:54:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:14,473 INFO L225 Difference]: With dead ends: 59 [2024-10-14 01:54:14,474 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 01:54:14,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-14 01:54:14,475 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:14,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 77 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:54:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 01:54:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 01:54:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:54:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-14 01:54:14,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 34 [2024-10-14 01:54:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:14,481 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-14 01:54:14,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 01:54:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-14 01:54:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:54:14,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:14,482 INFO L215 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] [2024-10-14 01:54:14,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 01:54:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 01:54:14,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:14,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 573893716, now seen corresponding path program 2 times [2024-10-14 01:54:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114339873] [2024-10-14 01:54:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 01:54:14,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:14,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114339873] [2024-10-14 01:54:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114339873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:14,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392979481] [2024-10-14 01:54:14,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:54:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:14,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:14,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 01:54:14,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:54:14,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:14,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 01:54:14,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 01:54:15,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 01:54:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392979481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:54:15,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:54:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-10-14 01:54:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717334557] [2024-10-14 01:54:15,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:15,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:54:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:54:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:54:15,064 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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) [2024-10-14 01:54:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:15,131 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-10-14 01:54:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:54:15,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 34 [2024-10-14 01:54:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:15,132 INFO L225 Difference]: With dead ends: 32 [2024-10-14 01:54:15,132 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 01:54:15,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-14 01:54:15,133 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:15,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 52 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:54:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 01:54:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 01:54:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:54:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 01:54:15,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-10-14 01:54:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 01:54:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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) [2024-10-14 01:54:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 01:54:15,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 01:54:15,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:54:15,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 01:54:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 01:54:15,341 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 01:54:15,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 01:54:15,752 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:54:15,764 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,764 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,764 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-14 01:54:15,765 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-14 01:54:15,765 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,765 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,765 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-14 01:54:15,765 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-14 01:54:15,766 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:54:15,767 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] [2024-10-14 01:54:15,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,769 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-14 01:54:15,770 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,771 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,772 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,773 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,774 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,775 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,776 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,784 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] [2024-10-14 01:54:15,785 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IdentifierExpression[~head!offset,]]]]] [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,786 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,787 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,788 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,788 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,788 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,788 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,788 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,789 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,790 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] [2024-10-14 01:54:15,791 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:54:15,792 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:54:15,797 WARN L155 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-14 01:54:15,801 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:54:15,802 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-10-14 01:54:15,802 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 01:54:15,802 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-10-14 01:54:15,802 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:54:15,803 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-14 01:54:15,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:54:15 BoogieIcfgContainer [2024-10-14 01:54:15,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:54:15,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:54:15,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:54:15,805 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:54:15,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:59" (3/4) ... [2024-10-14 01:54:15,807 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 01:54:15,811 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-10-14 01:54:15,816 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 01:54:15,817 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 01:54:15,817 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 01:54:15,817 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 01:54:15,916 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:54:15,916 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 01:54:15,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:54:15,917 INFO L158 Benchmark]: Toolchain (without parser) took 17389.26ms. Allocated memory was 172.0MB in the beginning and 348.1MB in the end (delta: 176.2MB). Free memory was 117.4MB in the beginning and 204.5MB in the end (delta: -87.1MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,917 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:54:15,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.27ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 97.3MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.07ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 95.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,918 INFO L158 Benchmark]: Boogie Preprocessor took 65.82ms. Allocated memory is still 172.0MB. Free memory was 95.1MB in the beginning and 91.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,918 INFO L158 Benchmark]: RCFGBuilder took 407.38ms. Allocated memory is still 172.0MB. Free memory was 91.9MB in the beginning and 73.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,919 INFO L158 Benchmark]: TraceAbstraction took 16289.84ms. Allocated memory was 172.0MB in the beginning and 348.1MB in the end (delta: 176.2MB). Free memory was 72.5MB in the beginning and 210.8MB in the end (delta: -138.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,919 INFO L158 Benchmark]: Witness Printer took 112.18ms. Allocated memory is still 348.1MB. Free memory was 209.8MB in the beginning and 204.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:54:15,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.27ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 97.3MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.07ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 95.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.82ms. Allocated memory is still 172.0MB. Free memory was 95.1MB in the beginning and 91.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.38ms. Allocated memory is still 172.0MB. Free memory was 91.9MB in the beginning and 73.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16289.84ms. Allocated memory was 172.0MB in the beginning and 348.1MB in the end (delta: 176.2MB). Free memory was 72.5MB in the beginning and 210.8MB in the end (delta: -138.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 112.18ms. Allocated memory is still 348.1MB. Free memory was 209.8MB in the beginning and 204.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IdentifierExpression[~head!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~s~0!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 1605 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 127 IncrementalHoareTripleChecker+Unchecked, 1386 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2288 IncrementalHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 219 mSDtfsCounter, 2288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 448 SyntacticMatches, 15 SemanticMatches, 213 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 82 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 628 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 839 ConstructedInterpolants, 17 QuantifiedInterpolants, 4085 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2678 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 281/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((((3 == data) && (index <= 0)) || ((3 == data) && (index == 1))) || ((2 == data) && (index <= 0))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 0) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((index == 1) || (index == 0)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2024-10-14 01:54:15,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE