./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/dll2c_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/dll2c_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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:52:26,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:52:26,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:52:26,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:52:26,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:52:27,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:52:27,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:52:27,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:52:27,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:52:27,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:52:27,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:52:27,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:52:27,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:52:27,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:52:27,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:52:27,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:52:27,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:52:27,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:52:27,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:52:27,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:52:27,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:52:27,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:52:27,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:52:27,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:52:27,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:52:27,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:52:27,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:52:27,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:52:27,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:52:27,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:52:27,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:52:27,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:52:27,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:52:27,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:52:27,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:52:27,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:52:27,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:52:27,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:52:27,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:52:27,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:52:27,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:52:27,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:52:27,044 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-10-14 01:52:27,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:52:27,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:52:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:52:27,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:52:27,338 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:52:27,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-10-14 01:52:28,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:52:29,063 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:52:29,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-10-14 01:52:29,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d16c205/bd2b4acf493d46b79d30f203f5233065/FLAG9876d71d6 [2024-10-14 01:52:29,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d16c205/bd2b4acf493d46b79d30f203f5233065 [2024-10-14 01:52:29,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:52:29,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:52:29,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:52:29,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:52:29,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:52:29,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6c33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29, skipping insertion in model container [2024-10-14 01:52:29,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:52:29,433 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/dll2c_update_all.i[24538,24551] [2024-10-14 01:52:29,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:52:29,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:52:29,541 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/dll2c_update_all.i[24538,24551] [2024-10-14 01:52:29,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:52:29,624 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:52:29,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29 WrapperNode [2024-10-14 01:52:29,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:52:29,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:52:29,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:52:29,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:52:29,633 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:52:29" (1/1) ... [2024-10-14 01:52:29,653 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:52:29" (1/1) ... [2024-10-14 01:52:29,683 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2024-10-14 01:52:29,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:52:29,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:52:29,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:52:29,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:52:29,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,729 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-10-14 01:52:29,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:52:29,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:52:29,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:52:29,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:52:29,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (1/1) ... [2024-10-14 01:52:29,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:52:29,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:29,785 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:52:29,792 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:52:29,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:52:29,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:52:29,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:52:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:52:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:52:29,840 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:52:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:52:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:52:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:52:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:52:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:52:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:52:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:52:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:52:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:52:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:52:29,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:52:29,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:52:30,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:52:30,252 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-14 01:52:30,253 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:52:30,294 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:52:30,294 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 01:52:30,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:30 BoogieIcfgContainer [2024-10-14 01:52:30,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:52:30,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:52:30,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:52:30,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:52:30,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:52:29" (1/3) ... [2024-10-14 01:52:30,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ebb043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:30, skipping insertion in model container [2024-10-14 01:52:30,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:29" (2/3) ... [2024-10-14 01:52:30,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ebb043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:30, skipping insertion in model container [2024-10-14 01:52:30,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:30" (3/3) ... [2024-10-14 01:52:30,303 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-10-14 01:52:30,325 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:52:30,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:52:30,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:52:30,392 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;@564b7a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:52:30,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:52:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 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:52:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:52:30,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:30,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:30,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:30,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -455146651, now seen corresponding path program 1 times [2024-10-14 01:52:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123567241] [2024-10-14 01:52:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:30,716 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:52:30,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123567241] [2024-10-14 01:52:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123567241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:30,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:30,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:52:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61347881] [2024-10-14 01:52:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:30,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:52:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:52:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:52:30,745 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 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:52:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:30,821 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2024-10-14 01:52:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:52:30,823 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:52:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:30,828 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:52:30,828 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 01:52:30,830 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:52:30,833 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:30,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 01:52:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 01:52:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:52:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-14 01:52:30,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2024-10-14 01:52:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:30,873 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-14 01:52:30,873 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:52:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-14 01:52:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:52:30,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:30,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:52:30,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1566924888, now seen corresponding path program 1 times [2024-10-14 01:52:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729005941] [2024-10-14 01:52:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,122 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:52:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729005941] [2024-10-14 01:52:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729005941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:31,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:52:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288633368] [2024-10-14 01:52:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:52:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:52:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:52:31,131 INFO L87 Difference]: Start difference. First operand 22 states and 28 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:52:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:31,194 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-14 01:52:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:52:31,195 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:52:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:31,195 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:52:31,196 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 01:52:31,196 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:52:31,198 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:31,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 01:52:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-14 01:52:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:52:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-14 01:52:31,209 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2024-10-14 01:52:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:31,210 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-14 01:52:31,210 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:52:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-14 01:52:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:52:31,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:31,211 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] [2024-10-14 01:52:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:52:31,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1754489508, now seen corresponding path program 1 times [2024-10-14 01:52:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611562947] [2024-10-14 01:52:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,470 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:52:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611562947] [2024-10-14 01:52:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611562947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:52:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185740183] [2024-10-14 01:52:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:52:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:31,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:52:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:52:31,478 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:52:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:31,564 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-14 01:52:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:52:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2024-10-14 01:52:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:31,566 INFO L225 Difference]: With dead ends: 39 [2024-10-14 01:52:31,566 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 01:52:31,567 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:52:31,568 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:31,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 01:52:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2024-10-14 01:52:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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:52:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 01:52:31,579 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 23 [2024-10-14 01:52:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:31,579 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 01:52:31,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:52:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 01:52:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:52:31,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:31,582 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, 1, 1] [2024-10-14 01:52:31,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:52:31,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:31,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash -600650578, now seen corresponding path program 1 times [2024-10-14 01:52:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996631791] [2024-10-14 01:52:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,794 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:52:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996631791] [2024-10-14 01:52:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996631791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295139025] [2024-10-14 01:52:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:31,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:31,797 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:52:31,804 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:52:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:31,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:52:31,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:32,092 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:52:32,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:32,166 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:52:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295139025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:32,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-10-14 01:52:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588708545] [2024-10-14 01:52:32,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:52:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:52:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:52:32,173 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:52:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:32,289 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-10-14 01:52:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:52:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 26 [2024-10-14 01:52:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:32,292 INFO L225 Difference]: With dead ends: 41 [2024-10-14 01:52:32,292 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 01:52:32,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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:52:32,294 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:32,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 59 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 01:52:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-10-14 01:52:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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:52:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-14 01:52:32,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 26 [2024-10-14 01:52:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-14 01:52:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:52:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-14 01:52:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:52:32,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:32,308 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:52:32,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:32,508 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:52:32,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:32,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash 791643164, now seen corresponding path program 2 times [2024-10-14 01:52:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676504670] [2024-10-14 01:52:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:32,679 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:52:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676504670] [2024-10-14 01:52:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676504670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362672243] [2024-10-14 01:52:32,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:52:32,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:32,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:32,683 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:52:32,684 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:52:32,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:52:32,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:52:32,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:52:32,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:32,932 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:52:32,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:32,974 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:52:32,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362672243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:32,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:32,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-14 01:52:32,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001172126] [2024-10-14 01:52:32,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:32,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:52:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:32,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:52:32,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:52:32,976 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:52:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:33,086 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2024-10-14 01:52:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:52:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:52:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:33,091 INFO L225 Difference]: With dead ends: 44 [2024-10-14 01:52:33,091 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 01:52:33,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 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:52:33,092 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:33,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 01:52:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2024-10-14 01:52:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:52:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-14 01:52:33,101 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 29 [2024-10-14 01:52:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:33,102 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-14 01:52:33,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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:52:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-14 01:52:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:52:33,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:33,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:33,122 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:52:33,304 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:52:33,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -768538363, now seen corresponding path program 1 times [2024-10-14 01:52:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964977023] [2024-10-14 01:52:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:34,810 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:52:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964977023] [2024-10-14 01:52:34,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964977023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25894888] [2024-10-14 01:52:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:34,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:34,813 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:52:34,815 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:52:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:34,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-14 01:52:34,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:35,032 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:52:35,213 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:52:35,214 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:52:35,256 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:52:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:52:35,440 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-10-14 01:52:35,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 83 [2024-10-14 01:52:35,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2024-10-14 01:52:35,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 22 [2024-10-14 01:52:35,612 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:52:35,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-10-14 01:52:35,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-10-14 01:52:35,821 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:52:36,020 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:52:36,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:36,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-10-14 01:52:36,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:36,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-14 01:52:36,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:36,329 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 64 treesize of output 63 [2024-10-14 01:52:36,334 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 25 treesize of output 21 [2024-10-14 01:52:36,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_671) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_672) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-10-14 01:52:36,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:36,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-14 01:52:36,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-10-14 01:52:36,641 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:52:36,650 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:52:36,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 6 treesize of output 4 [2024-10-14 01:52:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-14 01:52:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25894888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:36,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:36,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 58 [2024-10-14 01:52:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604432525] [2024-10-14 01:52:36,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:36,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-14 01:52:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-14 01:52:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2866, Unknown=38, NotChecked=218, Total=3306 [2024-10-14 01:52:36,986 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 58 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 49 states have internal predecessors, (72), 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:52:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:38,259 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-10-14 01:52:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 01:52:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 49 states have internal predecessors, (72), 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 30 [2024-10-14 01:52:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:38,261 INFO L225 Difference]: With dead ends: 65 [2024-10-14 01:52:38,261 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 01:52:38,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=335, Invalid=4465, Unknown=38, NotChecked=274, Total=5112 [2024-10-14 01:52:38,264 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 166 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:38,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 419 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 839 Invalid, 0 Unknown, 138 Unchecked, 0.6s Time] [2024-10-14 01:52:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 01:52:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-14 01:52:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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:52:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-14 01:52:38,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 30 [2024-10-14 01:52:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:38,274 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-14 01:52:38,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 49 states have internal predecessors, (72), 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:52:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-14 01:52:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:52:38,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:38,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:38,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:38,478 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:52:38,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1945133887, now seen corresponding path program 1 times [2024-10-14 01:52:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298880140] [2024-10-14 01:52:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,588 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:52:38,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298880140] [2024-10-14 01:52:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298880140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:38,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:52:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:52:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129194692] [2024-10-14 01:52:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:38,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:52:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:52:38,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:52:38,594 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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:52:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:38,649 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-10-14 01:52:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:52:38,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 31 [2024-10-14 01:52:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:38,651 INFO L225 Difference]: With dead ends: 59 [2024-10-14 01:52:38,651 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 01:52:38,651 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:52:38,652 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:38,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 01:52:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-14 01:52:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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:52:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-14 01:52:38,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 31 [2024-10-14 01:52:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-14 01:52:38,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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:52:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-14 01:52:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:52:38,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:38,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 01:52:38,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1889525444, now seen corresponding path program 2 times [2024-10-14 01:52:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939899387] [2024-10-14 01:52:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:38,776 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:52:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939899387] [2024-10-14 01:52:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939899387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083541085] [2024-10-14 01:52:38,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:52:38,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:38,778 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:52:38,780 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:52:39,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:52:39,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:52:39,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 01:52:39,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:39,083 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:52:39,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:39,116 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:52:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083541085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:39,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:39,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-10-14 01:52:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619280493] [2024-10-14 01:52:39,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:39,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:52:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:52:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:52:39,118 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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:52:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:39,219 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2024-10-14 01:52:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 01:52:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 31 [2024-10-14 01:52:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:39,221 INFO L225 Difference]: With dead ends: 81 [2024-10-14 01:52:39,223 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 01:52:39,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 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:52:39,223 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:39,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 107 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 01:52:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2024-10-14 01:52:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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:52:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-10-14 01:52:39,240 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 31 [2024-10-14 01:52:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:39,240 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-10-14 01:52:39,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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:52:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-10-14 01:52:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:52:39,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:39,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:39,263 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:52:39,444 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:52:39,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 740548731, now seen corresponding path program 1 times [2024-10-14 01:52:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521249899] [2024-10-14 01:52:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,569 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:52:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521249899] [2024-10-14 01:52:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521249899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467804665] [2024-10-14 01:52:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:39,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:39,572 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:52:39,573 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:52:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:39,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:52:39,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:39,779 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:52:39,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:39,813 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:52:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467804665] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:39,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:39,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-10-14 01:52:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555431787] [2024-10-14 01:52:39,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:52:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:52:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:52:39,815 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:52:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:39,894 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-10-14 01:52:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:52:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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 34 [2024-10-14 01:52:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:39,896 INFO L225 Difference]: With dead ends: 64 [2024-10-14 01:52:39,896 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 01:52:39,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:52:39,897 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:39,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 98 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 01:52:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-10-14 01:52:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 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:52:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-10-14 01:52:39,911 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 34 [2024-10-14 01:52:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-10-14 01:52:39,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:52:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-10-14 01:52:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 01:52:39,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:39,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:39,933 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:52:40,114 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:52:40,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:40,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1482193545, now seen corresponding path program 1 times [2024-10-14 01:52:40,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659971162] [2024-10-14 01:52:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:41,633 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:52:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659971162] [2024-10-14 01:52:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659971162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117636240] [2024-10-14 01:52:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:41,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:41,636 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:52:41,637 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:52:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:41,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-14 01:52:41,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:41,862 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:52:42,057 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:52:42,057 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:52:42,094 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:52:42,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:52:42,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-10-14 01:52:42,315 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-10-14 01:52:42,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 83 [2024-10-14 01:52:42,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2024-10-14 01:52:42,583 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 8 treesize of output 1 [2024-10-14 01:52:42,600 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2024-10-14 01:52:42,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 111 [2024-10-14 01:52:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:42,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:42,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2024-10-14 01:52:42,804 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:52:42,804 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 81 treesize of output 70 [2024-10-14 01:52:42,810 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 25 treesize of output 17 [2024-10-14 01:52:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:52:42,815 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:52:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2024-10-14 01:52:43,098 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:52:43,179 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:52:43,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:43,238 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:52:43,248 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_1292 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1292) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1))) is different from false [2024-10-14 01:52:43,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1291) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (forall ((v_ArrVal_1292 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1292) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)))) is different from false [2024-10-14 01:52:43,376 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 230 treesize of output 214 [2024-10-14 01:52:43,379 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 60 treesize of output 56 [2024-10-14 01:52:43,383 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 28 treesize of output 26 [2024-10-14 01:52:43,812 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1286 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1286) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_1286 (Array Int Int))) (or (forall ((v_ArrVal_1288 Int) (v_ArrVal_1292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1286))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_1288)) .cse0 v_ArrVal_1292) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-14 01:52:43,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:52:43,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-14 01:52:43,990 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 131 treesize of output 119 [2024-10-14 01:52:43,995 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:52:43,999 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:52:44,003 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:52:44,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:52:44,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:52:44,012 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:52:44,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 1 [2024-10-14 01:52:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 01:52:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117636240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:44,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 24] total 62 [2024-10-14 01:52:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175096170] [2024-10-14 01:52:44,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:44,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-14 01:52:44,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-14 01:52:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3198, Unknown=53, NotChecked=348, Total=3782 [2024-10-14 01:52:44,333 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 62 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 53 states have internal predecessors, (83), 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:52:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:45,963 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2024-10-14 01:52:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 01:52:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 53 states have internal predecessors, (83), 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 35 [2024-10-14 01:52:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:45,965 INFO L225 Difference]: With dead ends: 86 [2024-10-14 01:52:45,965 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 01:52:45,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=311, Invalid=5194, Unknown=57, NotChecked=444, Total=6006 [2024-10-14 01:52:45,967 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:45,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 553 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1038 Invalid, 4 Unknown, 213 Unchecked, 0.8s Time] [2024-10-14 01:52:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 01:52:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2024-10-14 01:52:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 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:52:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-10-14 01:52:45,985 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 35 [2024-10-14 01:52:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:45,985 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-10-14 01:52:45,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 53 states have internal predecessors, (83), 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:52:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-10-14 01:52:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 01:52:45,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:45,986 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, 1, 1] [2024-10-14 01:52:46,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:46,186 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:52:46,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:46,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1621294267, now seen corresponding path program 3 times [2024-10-14 01:52:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:46,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503626873] [2024-10-14 01:52:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:46,323 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:52:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503626873] [2024-10-14 01:52:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503626873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740811099] [2024-10-14 01:52:46,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:52:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:46,326 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:52:46,327 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:52:46,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 01:52:46,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:52:46,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:52:46,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:46,762 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:52:46,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:52:46,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740811099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:46,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:52:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-14 01:52:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927226007] [2024-10-14 01:52:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:52:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:52:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:52:46,765 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:52:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:46,807 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-14 01:52:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:52:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 35 [2024-10-14 01:52:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:46,808 INFO L225 Difference]: With dead ends: 83 [2024-10-14 01:52:46,808 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 01:52:46,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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:52:46,809 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:46,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 48 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 01:52:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-10-14 01:52:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 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:52:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-14 01:52:46,823 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 35 [2024-10-14 01:52:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:46,824 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-14 01:52:46,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:52:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-14 01:52:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:52:46,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:46,825 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, 1, 1] [2024-10-14 01:52:46,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 01:52:47,025 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:52:47,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1296620997, now seen corresponding path program 2 times [2024-10-14 01:52:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108367792] [2024-10-14 01:52:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,169 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:52:47,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108367792] [2024-10-14 01:52:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108367792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505909668] [2024-10-14 01:52:47,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:52:47,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:47,172 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:52:47,174 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:52:47,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:52:47,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:52:47,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 01:52:47,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:47,441 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:52:47,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:52:47,492 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:52:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505909668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:52:47,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:52:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-10-14 01:52:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409588080] [2024-10-14 01:52:47,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:52:47,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:52:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:52:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:52:47,494 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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:52:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:47,592 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-10-14 01:52:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:52:47,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 36 [2024-10-14 01:52:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:47,593 INFO L225 Difference]: With dead ends: 62 [2024-10-14 01:52:47,593 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 01:52:47,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 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:52:47,594 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:47,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:52:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 01:52:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-14 01:52:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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:52:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-14 01:52:47,601 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2024-10-14 01:52:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:47,602 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-14 01:52:47,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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:52:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-14 01:52:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 01:52:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:52:47,603 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:52:47,622 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:52:47,803 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:52:47,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:52:47,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:52:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1318083711, now seen corresponding path program 4 times [2024-10-14 01:52:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:52:47,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218860294] [2024-10-14 01:52:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:52:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:52:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:52:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:52:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 01:52:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:52:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 01:52:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:52:47,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218860294] [2024-10-14 01:52:47,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218860294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:52:47,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92555771] [2024-10-14 01:52:47,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 01:52:47,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:52:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:52:47,925 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:52:47,927 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:52:48,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 01:52:48,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:52:48,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:52:48,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:52:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:52:48,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:52:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92555771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:52:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:52:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-14 01:52:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996003473] [2024-10-14 01:52:48,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:52:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:52:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:52:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:52:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:52:48,608 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 01:52:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:52:48,623 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-14 01:52:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:52:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 01:52:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:52:48,623 INFO L225 Difference]: With dead ends: 41 [2024-10-14 01:52:48,623 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 01:52:48,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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:52:48,624 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:52:48,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:52:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 01:52:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 01:52:48,625 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:52:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 01:52:48,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-10-14 01:52:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:52:48,625 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 01:52:48,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 01:52:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 01:52:48,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 01:52:48,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:52:48,649 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:52:48,829 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:52:48,833 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 01:52:48,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 01:52:49,270 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:52:49,288 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:52:49,291 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,291 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,292 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:52:49,292 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,292 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,292 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,292 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:52:49,292 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,294 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,294 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,294 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:52:49,294 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,294 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,295 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:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,295 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:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,295 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:52:49,296 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,298 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,298 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:52:49,298 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,298 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:52:49,298 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,299 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:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,299 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:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,300 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:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,300 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:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,300 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:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,300 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,301 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:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,301 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:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,301 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:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,301 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,306 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,310 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,310 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:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,311 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:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,311 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:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,311 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:52:49,311 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,312 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:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,312 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:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,312 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,336 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:52:49,337 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,337 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,337 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:52:49,337 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,338 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,338 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:52:49,338 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,339 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,343 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,343 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:52:49,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,344 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:52:49,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,344 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:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,345 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:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,345 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:52:49,345 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,346 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,346 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,346 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:52:49,346 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,346 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,346 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:52:49,346 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,347 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,347 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:52:49,347 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,347 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,351 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:52:49,351 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,351 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,351 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,352 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:52:49,352 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,352 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,352 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,352 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:52:49,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,353 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:52:49,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,354 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:52:49,354 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,354 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,354 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:52:49,354 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,355 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-14 01:52:49,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,356 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:52:49,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:52:49,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-14 01:52:49,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-14 01:52:49,357 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:52:49,357 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-14 01:52:49,357 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:52:49,357 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-14 01:52:49,357 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:52:49,358 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-14 01:52:49,358 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-14 01:52:49,358 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-14 01:52:49,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,365 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,365 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,366 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:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,366 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,367 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:52:49,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-14 01:52:49,367 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,368 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:52:49,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,368 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:52:49,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,368 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:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-14 01:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,369 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:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-14 01:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,369 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,370 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:52:49,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,370 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:52:49,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,370 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,370 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:52:49,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:52:49,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,371 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,371 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:52:49,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,372 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:52:49,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,372 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,372 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:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,373 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:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 01:52:49,373 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 01:52:49,374 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:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-14 01:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,374 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:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,374 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:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2024-10-14 01:52:49,374 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-14 01:52:49,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-14 01:52:49,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-14 01:52:49,375 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:52:49,375 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2024-10-14 01:52:49,378 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:52:49,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:52:49,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-10-14 01:52:49,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 01:52:49,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-10-14 01:52:49,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-14 01:52:49,382 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-14 01:52:49,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:52:49 BoogieIcfgContainer [2024-10-14 01:52:49,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:52:49,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:52:49,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:52:49,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:52:49,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:30" (3/4) ... [2024-10-14 01:52:49,385 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 01:52:49,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-10-14 01:52:49,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 01:52:49,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 01:52:49,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 01:52:49,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 01:52:49,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:52:49,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 01:52:49,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:52:49,503 INFO L158 Benchmark]: Toolchain (without parser) took 20409.52ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 118.2MB in the beginning and 365.4MB in the end (delta: -247.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:52:49,503 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:52:49,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.93ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 154.6MB in the end (delta: -36.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.55ms. Allocated memory is still 188.7MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,504 INFO L158 Benchmark]: Boogie Preprocessor took 62.90ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 149.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,504 INFO L158 Benchmark]: RCFGBuilder took 546.23ms. Allocated memory is still 188.7MB. Free memory was 149.3MB in the beginning and 129.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,505 INFO L158 Benchmark]: TraceAbstraction took 19085.40ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 128.3MB in the beginning and 370.6MB in the end (delta: -242.3MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,505 INFO L158 Benchmark]: Witness Printer took 119.64ms. Allocated memory is still 415.2MB. Free memory was 370.6MB in the beginning and 365.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:52:49,509 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.15ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.93ms. Allocated memory is still 188.7MB. Free memory was 118.0MB in the beginning and 154.6MB in the end (delta: -36.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.55ms. Allocated memory is still 188.7MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.90ms. Allocated memory is still 188.7MB. Free memory was 152.5MB in the beginning and 149.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 546.23ms. Allocated memory is still 188.7MB. Free memory was 149.3MB in the beginning and 129.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19085.40ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 128.3MB in the beginning and 370.6MB in the end (delta: -242.3MB). Peak memory consumption was 179.2MB. Max. memory is 16.1GB. * Witness Printer took 119.64ms. Allocated memory is still 415.2MB. Free memory was 370.6MB in the beginning and 365.4MB 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: ~head!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_$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: #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: #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.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: ~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: #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: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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: ~len~0 - 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.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.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: ~head!offset - 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: ~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: ~len~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: #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: ~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: #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: #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.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.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_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[~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],[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: #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.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.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: #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.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.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_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[~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],[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~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: #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!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_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: ~i~0 - 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: #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!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: #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],[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_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: ~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.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.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: ~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[~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: #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: ~len~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: #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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IdentifierExpression[~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[~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: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~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: #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: 643]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 1676 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 351 IncrementalHoareTripleChecker+Unchecked, 1431 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2385 IncrementalHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 245 mSDtfsCounter, 2385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 456 SyntacticMatches, 15 SemanticMatches, 210 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, InterpolantAutomatonStates: 105, 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, 86 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 672 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 864 ConstructedInterpolants, 24 QuantifiedInterpolants, 5067 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3090 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 280/391 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: 620]: Loop Invariant Derived loop invariant: ((((index == 1) && (3 == data)) || ((3 == data) && (index <= 0))) || ((2 == data) && (index <= 0))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((i == 1) && (len == 2)) || ((2 <= i) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || ((i == 1) && (len == 2))) || ((2 <= i) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((index == 0) || (index == 1)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2024-10-14 01:52:49,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE