./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 14:56:44,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 14:56:44,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 14:56:45,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 14:56:45,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 14:56:45,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 14:56:45,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 14:56:45,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 14:56:45,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 14:56:45,069 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 14:56:45,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 14:56:45,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 14:56:45,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 14:56:45,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 14:56:45,072 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 14:56:45,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 14:56:45,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 14:56:45,072 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 14:56:45,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 14:56:45,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 14:56:45,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 14:56:45,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 14:56:45,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 14:56:45,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 14:56:45,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 14:56:45,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 14:56:45,076 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 14:56:45,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 14:56:45,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 14:56:45,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 14:56:45,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 14:56:45,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:56:45,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 14:56:45,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 14:56:45,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 14:56:45,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 14:56:45,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 14:56:45,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 14:56:45,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 14:56:45,080 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 14:56:45,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 14:56:45,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 14:56:45,080 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2023-11-23 14:56:45,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 14:56:45,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 14:56:45,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 14:56:45,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 14:56:45,386 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 14:56:45,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2023-11-23 14:56:46,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 14:56:46,913 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 14:56:46,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2023-11-23 14:56:46,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b18b78/c2cdd7dc4fc44211903cd76019794bfd/FLAG27da2d301 [2023-11-23 14:56:46,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b18b78/c2cdd7dc4fc44211903cd76019794bfd [2023-11-23 14:56:46,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 14:56:46,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 14:56:46,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 14:56:46,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 14:56:46,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 14:56:46,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:46" (1/1) ... [2023-11-23 14:56:46,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a52a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:46, skipping insertion in model container [2023-11-23 14:56:46,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:46" (1/1) ... [2023-11-23 14:56:47,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 14:56:47,375 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-11-23 14:56:47,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:56:47,389 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 14:56:47,437 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-11-23 14:56:47,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:56:47,469 INFO L206 MainTranslator]: Completed translation [2023-11-23 14:56:47,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47 WrapperNode [2023-11-23 14:56:47,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 14:56:47,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 14:56:47,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 14:56:47,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 14:56:47,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,505 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2023-11-23 14:56:47,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 14:56:47,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 14:56:47,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 14:56:47,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 14:56:47,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,540 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2023-11-23 14:56:47,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 14:56:47,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 14:56:47,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 14:56:47,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 14:56:47,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (1/1) ... [2023-11-23 14:56:47,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:56:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:47,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 14:56:47,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 14:56:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 14:56:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 14:56:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 14:56:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 14:56:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 14:56:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 14:56:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 14:56:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 14:56:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 14:56:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 14:56:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 14:56:47,794 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 14:56:47,796 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 14:56:47,979 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 14:56:48,021 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 14:56:48,022 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-23 14:56:48,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:48 BoogieIcfgContainer [2023-11-23 14:56:48,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 14:56:48,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 14:56:48,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 14:56:48,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 14:56:48,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:56:46" (1/3) ... [2023-11-23 14:56:48,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d40fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:48, skipping insertion in model container [2023-11-23 14:56:48,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:47" (2/3) ... [2023-11-23 14:56:48,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d40fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:48, skipping insertion in model container [2023-11-23 14:56:48,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:48" (3/3) ... [2023-11-23 14:56:48,029 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2023-11-23 14:56:48,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 14:56:48,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 14:56:48,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 14:56:48,087 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@4d8c5ff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 14:56:48,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 14:56:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 14:56:48,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:48,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:48,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:48,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -455146651, now seen corresponding path program 1 times [2023-11-23 14:56:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:48,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504218999] [2023-11-23 14:56:48,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:48,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:56:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504218999] [2023-11-23 14:56:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504218999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:48,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 14:56:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458095213] [2023-11-23 14:56:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:48,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 14:56:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 14:56:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 14:56:48,482 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:48,551 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2023-11-23 14:56:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 14:56:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-23 14:56:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:48,559 INFO L225 Difference]: With dead ends: 48 [2023-11-23 14:56:48,559 INFO L226 Difference]: Without dead ends: 22 [2023-11-23 14:56:48,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 14:56:48,566 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:48,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-23 14:56:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-23 14:56:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-23 14:56:48,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2023-11-23 14:56:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:48,593 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-23 14:56:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-23 14:56:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 14:56:48,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:48,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:48,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 14:56:48,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:48,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1566924888, now seen corresponding path program 1 times [2023-11-23 14:56:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228395057] [2023-11-23 14:56:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:56:48,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228395057] [2023-11-23 14:56:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228395057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 14:56:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899094785] [2023-11-23 14:56:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:48,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 14:56:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 14:56:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 14:56:48,720 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:48,774 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-11-23 14:56:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 14:56:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-23 14:56:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:48,776 INFO L225 Difference]: With dead ends: 38 [2023-11-23 14:56:48,776 INFO L226 Difference]: Without dead ends: 27 [2023-11-23 14:56:48,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 14:56:48,779 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:48,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-23 14:56:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-11-23 14:56:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-23 14:56:48,793 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2023-11-23 14:56:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:48,794 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-23 14:56:48,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 14:56:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-23 14:56:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 14:56:48,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:48,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:48,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 14:56:48,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:48,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1754489508, now seen corresponding path program 1 times [2023-11-23 14:56:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164309895] [2023-11-23 14:56:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:49,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164309895] [2023-11-23 14:56:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164309895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:49,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:49,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 14:56:49,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936494548] [2023-11-23 14:56:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:49,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 14:56:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 14:56:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 14:56:49,040 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:49,120 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-11-23 14:56:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 14:56:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-23 14:56:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:49,122 INFO L225 Difference]: With dead ends: 39 [2023-11-23 14:56:49,122 INFO L226 Difference]: Without dead ends: 32 [2023-11-23 14:56:49,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:49,125 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:49,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:56:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-23 14:56:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-11-23 14:56:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-23 14:56:49,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 23 [2023-11-23 14:56:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:49,134 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-23 14:56:49,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-23 14:56:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 14:56:49,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:49,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 14:56:49,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:49,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash -600650578, now seen corresponding path program 1 times [2023-11-23 14:56:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671821632] [2023-11-23 14:56:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 14:56:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671821632] [2023-11-23 14:56:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671821632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:49,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 14:56:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138715772] [2023-11-23 14:56:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:49,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:56:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:56:49,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:49,336 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:49,408 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2023-11-23 14:56:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:56:49,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-11-23 14:56:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:49,409 INFO L225 Difference]: With dead ends: 43 [2023-11-23 14:56:49,409 INFO L226 Difference]: Without dead ends: 33 [2023-11-23 14:56:49,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:56:49,410 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:49,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-23 14:56:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-11-23 14:56:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-11-23 14:56:49,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 26 [2023-11-23 14:56:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-11-23 14:56:49,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-11-23 14:56:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 14:56:49,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:49,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:49,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 14:56:49,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:49,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -979971405, now seen corresponding path program 1 times [2023-11-23 14:56:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157432772] [2023-11-23 14:56:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157432772] [2023-11-23 14:56:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157432772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128735432] [2023-11-23 14:56:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:49,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:49,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 14:56:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:49,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 14:56:49,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:49,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128735432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:56:49,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:56:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-23 14:56:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945316390] [2023-11-23 14:56:49,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:49,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 14:56:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 14:56:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:56:49,769 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:49,828 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-23 14:56:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:56:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-11-23 14:56:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:49,829 INFO L225 Difference]: With dead ends: 42 [2023-11-23 14:56:49,829 INFO L226 Difference]: Without dead ends: 35 [2023-11-23 14:56:49,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-23 14:56:49,830 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:49,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-23 14:56:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-11-23 14:56:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-23 14:56:49,835 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 27 [2023-11-23 14:56:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:49,835 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-23 14:56:49,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-11-23 14:56:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 14:56:49,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:49,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:49,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 14:56:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:50,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:50,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 503841783, now seen corresponding path program 2 times [2023-11-23 14:56:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405476043] [2023-11-23 14:56:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 14:56:50,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405476043] [2023-11-23 14:56:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405476043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 14:56:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523199728] [2023-11-23 14:56:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:50,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:56:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:56:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:56:50,177 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:50,238 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-23 14:56:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:56:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-23 14:56:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:50,239 INFO L225 Difference]: With dead ends: 41 [2023-11-23 14:56:50,239 INFO L226 Difference]: Without dead ends: 35 [2023-11-23 14:56:50,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:56:50,240 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:50,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 62 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-23 14:56:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-11-23 14:56:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:56:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-23 14:56:50,245 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 30 [2023-11-23 14:56:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:50,245 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-23 14:56:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-23 14:56:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 14:56:50,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:50,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 14:56:50,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:50,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1560754547, now seen corresponding path program 1 times [2023-11-23 14:56:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:50,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815952375] [2023-11-23 14:56:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 14:56:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815952375] [2023-11-23 14:56:51,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815952375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105025739] [2023-11-23 14:56:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:51,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:51,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 14:56:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:51,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-23 14:56:51,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:51,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 14:56:52,157 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 14:56:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 14:56:52,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 14:56:52,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 14:56:52,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-23 14:56:52,396 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-23 14:56:52,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 100 [2023-11-23 14:56:52,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2023-11-23 14:56:52,406 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 21 treesize of output 1 [2023-11-23 14:56:52,703 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-11-23 14:56:52,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 121 [2023-11-23 14:56:52,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 14:56:52,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-23 14:56:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 14:56:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 14:56:52,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2023-11-23 14:56:52,867 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 26 treesize of output 21 [2023-11-23 14:56:52,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 14:56:52,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-11-23 14:56:52,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2023-11-23 14:56:53,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-23 14:56:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 14:56:53,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:53,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 14:56:53,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2023-11-23 14:56:53,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 14:56:53,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2023-11-23 14:56:53,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-23 14:56:54,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_707 Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_704) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-11-23 14:56:54,219 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_707 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_704) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-11-23 14:56:54,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-23 14:56:54,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-23 14:56:54,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_705))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse5 v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse5))))))) (forall ((v_ArrVal_701 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2023-11-23 14:56:54,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 14:56:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-23 14:56:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2023-11-23 14:56:54,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 14:56:54,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 14:56:54,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 14:56:54,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,739 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 14:56:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-23 14:56:54,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 14:56:54,748 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 14:56:54,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2023-11-23 14:56:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-23 14:56:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105025739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:56:55,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:56:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 62 [2023-11-23 14:56:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450432267] [2023-11-23 14:56:55,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:55,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-23 14:56:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:55,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-23 14:56:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3119, Unknown=112, NotChecked=348, Total=3782 [2023-11-23 14:56:55,054 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 14:56:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:57,002 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-11-23 14:56:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 14:56:57,004 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-11-23 14:56:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:57,009 INFO L225 Difference]: With dead ends: 68 [2023-11-23 14:56:57,009 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 14:56:57,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=368, Invalid=4926, Unknown=120, NotChecked=438, Total=5852 [2023-11-23 14:56:57,012 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 164 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:57,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 447 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 949 Invalid, 0 Unknown, 213 Unchecked, 0.8s Time] [2023-11-23 14:56:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 14:56:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2023-11-23 14:56:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-11-23 14:56:57,028 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 31 [2023-11-23 14:56:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:57,028 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-23 14:56:57,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 14:56:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-11-23 14:56:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 14:56:57,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:57,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:57,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 14:56:57,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-23 14:56:57,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:57,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1138731337, now seen corresponding path program 2 times [2023-11-23 14:56:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513144177] [2023-11-23 14:56:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 14:56:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513144177] [2023-11-23 14:56:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513144177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:56:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:56:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 14:56:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37976992] [2023-11-23 14:56:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:57,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 14:56:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 14:56:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:56:57,337 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:57,391 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-11-23 14:56:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 14:56:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-23 14:56:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:57,393 INFO L225 Difference]: With dead ends: 57 [2023-11-23 14:56:57,393 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 14:56:57,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-23 14:56:57,393 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:57,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 49 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 14:56:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 14:56:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-11-23 14:56:57,401 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 32 [2023-11-23 14:56:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:57,401 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-11-23 14:56:57,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-11-23 14:56:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 14:56:57,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:57,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:57,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 14:56:57,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:57,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 245913690, now seen corresponding path program 3 times [2023-11-23 14:56:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813020775] [2023-11-23 14:56:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:56:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813020775] [2023-11-23 14:56:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813020775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137819126] [2023-11-23 14:56:57,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 14:56:57,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:57,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:57,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 14:56:58,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 14:56:58,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:56:58,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 14:56:58,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 14:56:58,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 14:56:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137819126] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:58,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:56:58,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2023-11-23 14:56:58,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023730712] [2023-11-23 14:56:58,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:56:58,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 14:56:58,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:58,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 14:56:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:56:58,108 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:58,149 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2023-11-23 14:56:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 14:56:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-23 14:56:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:58,150 INFO L225 Difference]: With dead ends: 64 [2023-11-23 14:56:58,150 INFO L226 Difference]: Without dead ends: 54 [2023-11-23 14:56:58,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-23 14:56:58,151 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:58,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:56:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-23 14:56:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2023-11-23 14:56:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-11-23 14:56:58,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 32 [2023-11-23 14:56:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:58,157 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-11-23 14:56:58,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-23 14:56:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-11-23 14:56:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 14:56:58,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:58,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:58,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 14:56:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:58,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:58,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1034992552, now seen corresponding path program 4 times [2023-11-23 14:56:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957888685] [2023-11-23 14:56:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 14:56:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957888685] [2023-11-23 14:56:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957888685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147263570] [2023-11-23 14:56:58,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 14:56:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:58,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:58,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 14:56:58,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 14:56:58,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:56:58,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 14:56:58,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:58,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:56:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 14:56:58,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147263570] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:56:58,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:56:58,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-23 14:56:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290794632] [2023-11-23 14:56:58,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:56:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 14:56:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:56:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 14:56:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-23 14:56:58,755 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:56:58,925 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2023-11-23 14:56:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 14:56:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-11-23 14:56:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:56:58,926 INFO L225 Difference]: With dead ends: 78 [2023-11-23 14:56:58,926 INFO L226 Difference]: Without dead ends: 62 [2023-11-23 14:56:58,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-11-23 14:56:58,927 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:56:58,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 159 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:56:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-23 14:56:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2023-11-23 14:56:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:56:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2023-11-23 14:56:58,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 32 [2023-11-23 14:56:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:56:58,937 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2023-11-23 14:56:58,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:56:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2023-11-23 14:56:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 14:56:58,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:56:58,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:56:58,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 14:56:59,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:59,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:56:59,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:56:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1337878013, now seen corresponding path program 1 times [2023-11-23 14:56:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:56:59,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428930409] [2023-11-23 14:56:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:56:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:56:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:56:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 14:56:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:56:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428930409] [2023-11-23 14:56:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428930409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:56:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386084710] [2023-11-23 14:56:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:56:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:56:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:56:59,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:56:59,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 14:56:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:56:59,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-23 14:56:59,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:56:59,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-23 14:57:00,165 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 23 treesize of output 11 [2023-11-23 14:57:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:57:00,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:57:00,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-23 14:57:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 14:57:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386084710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:57:00,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:57:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 28 [2023-11-23 14:57:00,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153990236] [2023-11-23 14:57:00,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:57:00,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 14:57:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:57:00,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 14:57:00,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2023-11-23 14:57:00,336 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:57:00,881 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2023-11-23 14:57:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 14:57:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-23 14:57:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:57:00,882 INFO L225 Difference]: With dead ends: 77 [2023-11-23 14:57:00,882 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 14:57:00,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 14:57:00,884 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 97 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 14:57:00,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 342 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 14:57:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 14:57:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2023-11-23 14:57:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:57:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2023-11-23 14:57:00,895 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 35 [2023-11-23 14:57:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:57:00,895 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2023-11-23 14:57:00,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2023-11-23 14:57:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 14:57:00,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:57:00,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:57:00,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 14:57:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 14:57:01,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:57:01,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:57:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1788889884, now seen corresponding path program 5 times [2023-11-23 14:57:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:57:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183530930] [2023-11-23 14:57:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:57:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:57:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:57:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:57:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 14:57:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:57:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183530930] [2023-11-23 14:57:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183530930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:57:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567128926] [2023-11-23 14:57:01,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-23 14:57:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:57:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:57:01,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:57:01,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 14:57:01,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-23 14:57:01,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:57:01,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 14:57:01,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:57:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 14:57:01,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:57:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 14:57:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567128926] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:57:01,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:57:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-23 14:57:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216076984] [2023-11-23 14:57:01,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:57:01,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 14:57:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:57:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 14:57:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-23 14:57:01,460 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:57:01,605 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2023-11-23 14:57:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 14:57:01,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-23 14:57:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:57:01,606 INFO L225 Difference]: With dead ends: 88 [2023-11-23 14:57:01,606 INFO L226 Difference]: Without dead ends: 56 [2023-11-23 14:57:01,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-11-23 14:57:01,607 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:57:01,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 95 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:57:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-23 14:57:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-11-23 14:57:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:57:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-11-23 14:57:01,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 35 [2023-11-23 14:57:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:57:01,615 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-11-23 14:57:01,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-11-23 14:57:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 14:57:01,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:57:01,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:57:01,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 14:57:01,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:57:01,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:57:01,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:57:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1475473921, now seen corresponding path program 2 times [2023-11-23 14:57:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:57:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953944407] [2023-11-23 14:57:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:57:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:57:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:57:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:57:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 14:57:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:57:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953944407] [2023-11-23 14:57:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953944407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:57:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897231032] [2023-11-23 14:57:01,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:57:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:57:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:57:01,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:57:01,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 14:57:02,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:57:02,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:57:02,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 14:57:02,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:57:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 14:57:02,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:57:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 14:57:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897231032] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:57:02,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:57:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2023-11-23 14:57:02,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141008662] [2023-11-23 14:57:02,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:57:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 14:57:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:57:02,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 14:57:02,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-23 14:57:02,274 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:57:02,357 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-11-23 14:57:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 14:57:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-11-23 14:57:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:57:02,358 INFO L225 Difference]: With dead ends: 56 [2023-11-23 14:57:02,358 INFO L226 Difference]: Without dead ends: 34 [2023-11-23 14:57:02,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-23 14:57:02,358 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:57:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:57:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-23 14:57:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-23 14:57:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:57:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-23 14:57:02,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 36 [2023-11-23 14:57:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:57:02,364 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-23 14:57:02,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-23 14:57:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-23 14:57:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 14:57:02,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:57:02,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:57:02,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 14:57:02,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:57:02,567 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:57:02,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:57:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1416791151, now seen corresponding path program 6 times [2023-11-23 14:57:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:57:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191756550] [2023-11-23 14:57:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:57:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:57:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 14:57:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 14:57:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 14:57:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:57:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 14:57:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:57:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191756550] [2023-11-23 14:57:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191756550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:57:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630469505] [2023-11-23 14:57:02,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-23 14:57:02,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:57:02,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:57:02,692 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:57:02,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 14:57:03,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-23 14:57:03,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:57:03,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 14:57:03,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:57:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-23 14:57:03,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 14:57:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630469505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:57:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 14:57:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-23 14:57:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771605247] [2023-11-23 14:57:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:57:03,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 14:57:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:57:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 14:57:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:57:03,624 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:57:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:57:03,639 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-11-23 14:57:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 14:57:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-11-23 14:57:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:57:03,640 INFO L225 Difference]: With dead ends: 37 [2023-11-23 14:57:03,640 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 14:57:03,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:57:03,641 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:57:03,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:57:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 14:57:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 14:57:03,642 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) [2023-11-23 14:57:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 14:57:03,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-11-23 14:57:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:57:03,642 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 14:57:03,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 14:57:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 14:57:03,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 14:57:03,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 14:57:03,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-23 14:57:03,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 14:57:03,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 14:57:04,372 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-11-23 14:57:04,372 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse7 (select .cse6 0))) (let ((.cse2 (= 3 (select (select |#memory_int#1| .cse7) 8))) (.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse7))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select .cse6 4) .cse7)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse3 .cse4 .cse5))))) [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-11-23 14:57:04,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse0 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8))) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse3 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1| 1) .cse0 (= 3 (select (select |#memory_int#1| .cse1) 8)) .cse2 (= (select .cse3 4) .cse1) .cse4))) (and (<= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse2 .cse4))) [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse10 (select .cse11 0))) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse7 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_2) .cse10))) (and (= (select |#memory_$Pointer$#1.base| .cse10) .cse12) (= v_DerPreprocessor_2 (store .cse12 4 .cse10)))))) (.cse8 (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse2 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select .cse11 4) .cse10)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (not (= .cse1 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) .cse2 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= (select (select |#memory_int#1| .cse1) 8) 3) .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) .cse7 .cse8 .cse9 (not (= .cse1 |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0) 0) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse2 .cse9 (not .cse5) .cse3 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse10) .cse4 .cse6))))) [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2023-11-23 14:57:04,373 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 626 645) no Hoare annotation was computed. [2023-11-23 14:57:04,374 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse2)) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2))) [2023-11-23 14:57:04,374 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-11-23 14:57:04,374 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse14 (select .cse13 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse10 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse1 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse11 (select (select |#memory_int#1| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 8)) (.cse3 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8))) (.cse4 (= 3 (select (select |#memory_int#1| .cse14) 8))) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse8 (= (select .cse13 4) .cse14)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse6 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|))) (let ((.cse5 (select .cse6 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) 0) .cse2 .cse3 .cse4 (= .cse5 (select .cse6 (+ |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 4))) .cse7 .cse8 (= 3 (select (select |#memory_int#1| .cse5) 8)) (not (= .cse5 |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)) .cse9))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse10 (= .cse11 |ULTIMATE.start_main_~expected~0#1|) (= (mod |ULTIMATE.start_main_~expected~0#1| 2) 0) .cse3 .cse7 .cse12 .cse9) (and .cse0 .cse10 .cse1 .cse2 (= .cse11 3) .cse3 .cse4 .cse7 .cse12 .cse8 .cse9))))) [2023-11-23 14:57:04,374 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2023-11-23 14:57:04,374 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-23 14:57:04,374 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-23 14:57:04,374 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-11-23 14:57:04,374 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-23 14:57:04,377 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2023-11-23 14:57:04,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 14:57:04,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-11-23 14:57:04,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][8] could not be translated [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-23 14:57:04,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]] && v_DerPreprocessor_2 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]][4 := #memory_$Pointer$#1.base[~s~0!base][0]]) could not be translated [2023-11-23 14:57:04,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]] && v_DerPreprocessor_2 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]][4 := #memory_$Pointer$#1.base[~s~0!base][0]]) could not be translated [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-23 14:57:04,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-11-23 14:57:04,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-11-23 14:57:04,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-11-23 14:57:04,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-11-23 14:57:04,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 14:57:04,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][~head!offset] could not be translated [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset] could not be translated [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset + 4] could not be translated [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][~head!offset]][8] could not be translated [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset] could not be translated [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated [2023-11-23 14:57:04,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-11-23 14:57:04,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-11-23 14:57:04,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-11-23 14:57:04,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:57:04 BoogieIcfgContainer [2023-11-23 14:57:04,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 14:57:04,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 14:57:04,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 14:57:04,426 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 14:57:04,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:48" (3/4) ... [2023-11-23 14:57:04,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 14:57:04,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-23 14:57:04,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-23 14:57:04,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 14:57:04,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 14:57:04,434 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 14:57:04,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 14:57:04,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 14:57:04,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 14:57:04,532 INFO L158 Benchmark]: Toolchain (without parser) took 17584.86ms. Allocated memory was 138.4MB in the beginning and 335.5MB in the end (delta: 197.1MB). Free memory was 65.0MB in the beginning and 106.0MB in the end (delta: -41.0MB). Peak memory consumption was 158.8MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,532 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 14:57:04,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.69ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 64.8MB in the beginning and 139.3MB in the end (delta: -74.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.39ms. Allocated memory is still 174.1MB. Free memory was 139.3MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,533 INFO L158 Benchmark]: Boogie Preprocessor took 49.22ms. Allocated memory is still 174.1MB. Free memory was 137.1MB in the beginning and 134.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,534 INFO L158 Benchmark]: RCFGBuilder took 466.97ms. Allocated memory is still 174.1MB. Free memory was 134.2MB in the beginning and 115.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,534 INFO L158 Benchmark]: TraceAbstraction took 16401.01ms. Allocated memory was 174.1MB in the beginning and 335.5MB in the end (delta: 161.5MB). Free memory was 115.0MB in the beginning and 112.3MB in the end (delta: 2.7MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,534 INFO L158 Benchmark]: Witness Printer took 106.23ms. Allocated memory is still 335.5MB. Free memory was 112.3MB in the beginning and 106.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 14:57:04,536 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.14ms. Allocated memory is still 138.4MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.69ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 64.8MB in the beginning and 139.3MB in the end (delta: -74.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.39ms. Allocated memory is still 174.1MB. Free memory was 139.3MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.22ms. Allocated memory is still 174.1MB. Free memory was 137.1MB in the beginning and 134.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.97ms. Allocated memory is still 174.1MB. Free memory was 134.2MB in the beginning and 115.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16401.01ms. Allocated memory was 174.1MB in the beginning and 335.5MB in the end (delta: 161.5MB). Free memory was 115.0MB in the beginning and 112.3MB in the end (delta: 2.7MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. * Witness Printer took 106.23ms. Allocated memory is still 335.5MB. Free memory was 112.3MB in the beginning and 106.0MB in the end (delta: 6.3MB). 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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]] && v_DerPreprocessor_2 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]][4 := #memory_$Pointer$#1.base[~s~0!base][0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]] && v_DerPreprocessor_2 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~s~0!base][0] := v_DerPreprocessor_1][~s~0!base := v_DerPreprocessor_2][#memory_$Pointer$#1.base[~s~0!base][0]][4 := #memory_$Pointer$#1.base[~s~0!base][0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][~head!offset]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 1555 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 213 IncrementalHoareTripleChecker+Unchecked, 1297 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2114 IncrementalHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 258 mSDtfsCounter, 2114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 452 SyntacticMatches, 15 SemanticMatches, 208 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=10, InterpolantAutomatonStates: 120, 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, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 739 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2470 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 185 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 675 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 874 ConstructedInterpolants, 16 QuantifiedInterpolants, 5007 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2654 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 309/409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((2 == data) && (index <= 0)) || ((index == 1) && (3 == data))) || ((3 == data) && (index == 0))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || (((i + 1) <= 0) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((index == 1) || (index <= 0)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2023-11-23 14:57:04,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE