./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.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 b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:00:02,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:00:02,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:00:02,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:00:02,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:00:02,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:00:02,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:00:02,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:00:02,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:00:02,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:00:02,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:00:02,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:00:02,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:00:02,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:00:02,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:00:02,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:00:02,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:00:02,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:00:02,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:00:02,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:00:02,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:00:02,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:00:02,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:00:02,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:00:02,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:00:02,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:00:02,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:00:02,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:00:02,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:00:02,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:00:02,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:00:02,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:00:02,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:02,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:00:02,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:00:02,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:00:02,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:00:02,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:00:02,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:00:02,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:00:02,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:00:02,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:00:02,422 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 -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2024-11-08 14:00:02,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:00:02,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:00:02,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:00:02,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:00:02,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:00:02,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2024-11-08 14:00:04,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:00:04,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:00:04,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2024-11-08 14:00:04,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9393a8e7f/9f6090c4a4924afead8863f51072e358/FLAG088ffa799 [2024-11-08 14:00:04,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9393a8e7f/9f6090c4a4924afead8863f51072e358 [2024-11-08 14:00:04,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:00:04,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:00:04,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:04,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:00:04,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:00:04,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:04" (1/1) ... [2024-11-08 14:00:04,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547599f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:04, skipping insertion in model container [2024-11-08 14:00:04,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:04" (1/1) ... [2024-11-08 14:00:04,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:00:05,123 WARN L250 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/sll2n_remove_all_reverse.i[24038,24051] [2024-11-08 14:00:05,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:05,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:00:05,175 WARN L250 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/sll2n_remove_all_reverse.i[24038,24051] [2024-11-08 14:00:05,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:05,208 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:00:05,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05 WrapperNode [2024-11-08 14:00:05,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:05,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:05,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:00:05,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:00:05,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,261 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2024-11-08 14:00:05,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:05,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:00:05,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:00:05,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:00:05,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,305 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-08 14:00:05,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:00:05,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:00:05,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:00:05,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:00:05,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (1/1) ... [2024-11-08 14:00:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:05,361 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-11-08 14:00:05,370 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-11-08 14:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 14:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 14:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 14:00:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 14:00:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 14:00:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:00:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:00:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:00:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:00:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:00:05,529 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:00:05,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:00:05,704 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 14:00:05,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:00:05,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:00:05,719 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 14:00:05,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:05 BoogieIcfgContainer [2024-11-08 14:00:05,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:00:05,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:00:05,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:00:05,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:00:05,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:00:04" (1/3) ... [2024-11-08 14:00:05,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1dffa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:05, skipping insertion in model container [2024-11-08 14:00:05,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:05" (2/3) ... [2024-11-08 14:00:05,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1dffa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:05, skipping insertion in model container [2024-11-08 14:00:05,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:05" (3/3) ... [2024-11-08 14:00:05,728 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2024-11-08 14:00:05,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:00:05,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:00:05,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:00:05,817 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;@7860c33b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:00:05,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:00:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:00:05,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:05,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:05,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1724473208, now seen corresponding path program 1 times [2024-11-08 14:00:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154009908] [2024-11-08 14:00:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:06,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-11-08 14:00:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:06,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154009908] [2024-11-08 14:00:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154009908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:06,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:00:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295063018] [2024-11-08 14:00:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:00:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:00:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:00:06,160 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11-08 14:00:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:06,183 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2024-11-08 14:00:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:00:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:00:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:06,204 INFO L225 Difference]: With dead ends: 46 [2024-11-08 14:00:06,205 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 14:00:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 14:00:06,213 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:06,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 14:00:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-08 14:00:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-11-08 14:00:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-08 14:00:06,264 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2024-11-08 14:00:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:06,264 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-08 14:00:06,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11-08 14:00:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-08 14:00:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 14:00:06,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:06,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:06,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:00:06,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1462004256, now seen corresponding path program 1 times [2024-11-08 14:00:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619304170] [2024-11-08 14:00:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619304170] [2024-11-08 14:00:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619304170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206002667] [2024-11-08 14:00:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:06,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:06,470 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-11-08 14:00:06,472 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-11-08 14:00:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:06,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:00:06,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:06,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206002667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:06,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 14:00:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522237331] [2024-11-08 14:00:06,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:00:06,709 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:06,736 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-08 14:00:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:00:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 14:00:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:06,738 INFO L225 Difference]: With dead ends: 39 [2024-11-08 14:00:06,738 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 14:00:06,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:00:06,739 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:06,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 14:00:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 14:00:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-08 14:00:06,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2024-11-08 14:00:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:06,746 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-08 14:00:06,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-08 14:00:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 14:00:06,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:06,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:06,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:00:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:06,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1187831688, now seen corresponding path program 2 times [2024-11-08 14:00:06,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:06,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194764551] [2024-11-08 14:00:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:00:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194764551] [2024-11-08 14:00:07,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194764551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:07,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:07,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 14:00:07,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241888866] [2024-11-08 14:00:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:07,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:00:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:07,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:00:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:00:07,120 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 14:00:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:07,141 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-08 14:00:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:00:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-08 14:00:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:07,145 INFO L225 Difference]: With dead ends: 37 [2024-11-08 14:00:07,146 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 14:00:07,146 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-11-08 14:00:07,147 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 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-11-08 14:00:07,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 14:00:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2024-11-08 14:00:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-08 14:00:07,156 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2024-11-08 14:00:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-08 14:00:07,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-08 14:00:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-08 14:00:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 14:00:07,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:07,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:07,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:00:07,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:07,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 419983469, now seen corresponding path program 1 times [2024-11-08 14:00:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855927953] [2024-11-08 14:00:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:07,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855927953] [2024-11-08 14:00:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855927953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933381570] [2024-11-08 14:00:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:07,357 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-11-08 14:00:07,358 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-11-08 14:00:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:07,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 14:00:07,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:00:07,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:00:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933381570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:07,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-08 14:00:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597707464] [2024-11-08 14:00:07,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:07,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:00:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:00:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:07,591 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-11-08 14:00:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:07,626 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-08 14:00:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:00:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-08 14:00:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:07,628 INFO L225 Difference]: With dead ends: 38 [2024-11-08 14:00:07,629 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 14:00:07,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:07,631 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:07,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 14:00:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-08 14:00:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-11-08 14:00:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-08 14:00:07,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 23 [2024-11-08 14:00:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-08 14:00:07,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-11-08 14:00:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-08 14:00:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 14:00:07,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:07,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:07,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:00:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 14:00:07,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1335297746, now seen corresponding path program 2 times [2024-11-08 14:00:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510424000] [2024-11-08 14:00:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 14:00:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:08,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510424000] [2024-11-08 14:00:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510424000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:00:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892089206] [2024-11-08 14:00:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:08,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:08,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:00:08,116 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 14:00:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:08,165 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-08 14:00:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:00:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 14:00:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:08,169 INFO L225 Difference]: With dead ends: 48 [2024-11-08 14:00:08,169 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 14:00:08,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:08,170 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:08,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 14:00:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-08 14:00:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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-11-08 14:00:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-08 14:00:08,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2024-11-08 14:00:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:08,181 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-08 14:00:08,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 14:00:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-08 14:00:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 14:00:08,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:08,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:08,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:00:08,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:08,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1406064088, now seen corresponding path program 1 times [2024-11-08 14:00:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111716818] [2024-11-08 14:00:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 14:00:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111716818] [2024-11-08 14:00:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111716818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351634903] [2024-11-08 14:00:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:08,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:08,953 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-11-08 14:00:08,954 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-11-08 14:00:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:09,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 14:00:09,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:09,193 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 45 treesize of output 33 [2024-11-08 14:00:09,199 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 37 treesize of output 25 [2024-11-08 14:00:09,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-08 14:00:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 14:00:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 14:00:09,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351634903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:09,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:00:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-08 14:00:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507402183] [2024-11-08 14:00:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:09,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:09,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:00:09,276 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-11-08 14:00:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:09,332 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-08 14:00:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:00:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-08 14:00:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:09,334 INFO L225 Difference]: With dead ends: 53 [2024-11-08 14:00:09,334 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 14:00:09,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:00:09,337 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:09,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 14:00:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 14:00:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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-11-08 14:00:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-08 14:00:09,346 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 33 [2024-11-08 14:00:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:09,347 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-08 14:00:09,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-11-08 14:00:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-08 14:00:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:00:09,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:09,349 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:09,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:00:09,550 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-11-08 14:00:09,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:09,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1205422776, now seen corresponding path program 1 times [2024-11-08 14:00:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671640231] [2024-11-08 14:00:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671640231] [2024-11-08 14:00:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671640231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596767408] [2024-11-08 14:00:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:10,144 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-11-08 14:00:10,145 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-11-08 14:00:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:10,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-08 14:00:10,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:10,525 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 18 treesize of output 7 [2024-11-08 14:00:10,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 14:00:10,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:10,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:10,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 14:00:10,878 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 14:00:10,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2024-11-08 14:00:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:10,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:11,033 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 51 treesize of output 37 [2024-11-08 14:00:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 14:00:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596767408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:11,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 7] total 30 [2024-11-08 14:00:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592572763] [2024-11-08 14:00:11,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 14:00:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:11,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 14:00:11,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-11-08 14:00:11,149 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 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-11-08 14:00:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:11,374 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-11-08 14:00:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:00:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 14:00:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:11,375 INFO L225 Difference]: With dead ends: 65 [2024-11-08 14:00:11,375 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 14:00:11,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 14:00:11,376 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:11,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 193 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:00:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 14:00:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-08 14:00:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-08 14:00:11,382 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 37 [2024-11-08 14:00:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:11,383 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-08 14:00:11,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 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-11-08 14:00:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-08 14:00:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 14:00:11,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:11,384 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:11,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 14:00:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:11,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1492532109, now seen corresponding path program 2 times [2024-11-08 14:00:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478728546] [2024-11-08 14:00:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 14:00:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478728546] [2024-11-08 14:00:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478728546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362014448] [2024-11-08 14:00:12,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:12,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:12,529 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-11-08 14:00:12,530 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-11-08 14:00:12,813 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:12,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:12,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-08 14:00:12,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:12,866 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-11-08 14:00:12,920 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 18 treesize of output 7 [2024-11-08 14:00:12,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 14:00:12,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:12,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:13,037 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 14:00:13,037 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-11-08 14:00:13,099 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-11-08 14:00:13,110 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-11-08 14:00:13,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-08 14:00:13,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 14:00:13,421 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 41 [2024-11-08 14:00:13,598 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-08 14:00:13,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 27 [2024-11-08 14:00:13,608 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 15 treesize of output 7 [2024-11-08 14:00:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 14:00:13,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:13,846 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 84 treesize of output 64 [2024-11-08 14:00:13,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2024-11-08 14:00:14,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,013 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 14:00:14,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,021 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 14:00:14,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) is different from false [2024-11-08 14:00:14,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,355 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-08 14:00:14,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-08 14:00:14,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,370 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 18 treesize of output 20 [2024-11-08 14:00:14,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 14:00:14,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-08 14:00:14,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-08 14:00:14,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:14,430 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 18 treesize of output 20 [2024-11-08 14:00:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2024-11-08 14:00:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362014448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:14,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:14,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-11-08 14:00:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791866773] [2024-11-08 14:00:14,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:14,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 14:00:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 14:00:14,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1363, Unknown=1, NotChecked=74, Total=1560 [2024-11-08 14:00:14,576 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 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-11-08 14:00:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:15,154 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-08 14:00:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 14:00:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-08 14:00:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:15,156 INFO L225 Difference]: With dead ends: 86 [2024-11-08 14:00:15,156 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 14:00:15,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=1730, Unknown=1, NotChecked=84, Total=1980 [2024-11-08 14:00:15,158 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:15,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 304 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2024-11-08 14:00:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 14:00:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-08 14:00:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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-11-08 14:00:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-08 14:00:15,164 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2024-11-08 14:00:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:15,164 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-08 14:00:15,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 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-11-08 14:00:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-08 14:00:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 14:00:15,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:15,165 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:15,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 14:00:15,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:15,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:15,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -376100059, now seen corresponding path program 3 times [2024-11-08 14:00:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722396557] [2024-11-08 14:00:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 14:00:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722396557] [2024-11-08 14:00:15,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722396557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415537405] [2024-11-08 14:00:15,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:00:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:15,498 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-11-08 14:00:15,500 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-11-08 14:00:15,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 14:00:15,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:15,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 14:00:15,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 14:00:15,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:00:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415537405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:15,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:00:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-08 14:00:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098347338] [2024-11-08 14:00:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:15,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:15,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:15,835 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:15,843 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-08 14:00:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:00:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-08 14:00:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:15,844 INFO L225 Difference]: With dead ends: 51 [2024-11-08 14:00:15,844 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 14:00:15,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:15,845 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:15,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 14:00:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 14:00:15,846 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-11-08 14:00:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 14:00:15,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-11-08 14:00:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:15,847 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 14:00:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:00:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 14:00:15,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 14:00:15,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:00:15,871 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-11-08 14:00:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:16,058 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1] [2024-11-08 14:00:16,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 14:00:16,260 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:00:16,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-08 14:00:16,282 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-08 14:00:16,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-08 14:00:16,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-08 14:00:16,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,287 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-08 14:00:16,289 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,290 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base [2024-11-08 14:00:16,290 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,290 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,290 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,290 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-08 14:00:16,294 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 14:00:16,294 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 14:00:16,295 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:16,295 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,296 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,296 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,298 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 14:00:16,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,304 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,305 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-08 14:00:16,306 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-08 14:00:16,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-08 14:00:16,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-08 14:00:16,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-08 14:00:16,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:00:16 BoogieIcfgContainer [2024-11-08 14:00:16,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:00:16,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:00:16,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:00:16,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:00:16,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:05" (3/4) ... [2024-11-08 14:00:16,312 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 14:00:16,319 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 14:00:16,319 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 14:00:16,320 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 14:00:16,320 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 14:00:16,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:00:16,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 14:00:16,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:00:16,412 INFO L158 Benchmark]: Toolchain (without parser) took 11745.43ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 115.6MB in the beginning and 144.8MB in the end (delta: -29.1MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,412 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:00:16,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.85ms. Allocated memory is still 172.0MB. Free memory was 115.6MB in the beginning and 130.7MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,413 INFO L158 Benchmark]: Boogie Preprocessor took 57.07ms. Allocated memory is still 172.0MB. Free memory was 128.6MB in the beginning and 125.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,413 INFO L158 Benchmark]: RCFGBuilder took 399.68ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 110.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,413 INFO L158 Benchmark]: TraceAbstraction took 10586.51ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 109.1MB in the beginning and 150.0MB in the end (delta: -40.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,413 INFO L158 Benchmark]: Witness Printer took 102.67ms. Allocated memory is still 264.2MB. Free memory was 150.0MB in the beginning and 144.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 14:00:16,414 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.19ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.85ms. Allocated memory is still 172.0MB. Free memory was 115.6MB in the beginning and 130.7MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.07ms. Allocated memory is still 172.0MB. Free memory was 128.6MB in the beginning and 125.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 399.68ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 110.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10586.51ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 109.1MB in the beginning and 150.0MB in the end (delta: -40.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 102.67ms. Allocated memory is still 264.2MB. Free memory was 150.0MB in the beginning and 144.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~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[~last~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - 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!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[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~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[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - 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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.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],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] * 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: 619]: 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 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 872 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 707 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 165 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 262 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=8, InterpolantAutomatonStates: 60, 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, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 435 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 529 ConstructedInterpolants, 8 QuantifiedInterpolants, 3883 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 288/349 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: 599]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len == 1) && (len == 2)) || ((len <= 0) && (len == 2))) || ((2 == len) && (len == 2))) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-08 14:00:16,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE