./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.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 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:57:12,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:57:12,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:57:12,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:57:12,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:57:12,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:57:12,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:57:12,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:57:12,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:57:12,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:57:12,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:57:12,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:57:12,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:57:12,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:57:12,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:57:12,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:57:12,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:57:12,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:57:12,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:57:12,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:57:12,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:57:12,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:57:12,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:57:12,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:57:12,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:57:12,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:57:12,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:57:12,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:57:12,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:57:12,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:57:12,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:57:12,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:57:12,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:57:12,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:57:12,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:57:12,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:57:12,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:57:12,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:57:12,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:57:12,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:57:12,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:57:12,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:57:12,473 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 -> 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 [2024-11-22 10:57:12,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:57:12,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:57:12,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:57:12,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:57:12,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:57:12,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:13,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:57:14,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:57:14,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:14,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ca5c846/6a532ce67be543c4ad36ce203263c1e2/FLAG3c26ed482 [2024-11-22 10:57:14,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ca5c846/6a532ce67be543c4ad36ce203263c1e2 [2024-11-22 10:57:14,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:57:14,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:57:14,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:57:14,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:57:14,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:57:14,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462fa029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14, skipping insertion in model container [2024-11-22 10:57:14,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:57:14,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2024-11-22 10:57:14,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:57:14,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:57:14,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2024-11-22 10:57:14,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:57:14,513 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:57:14,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14 WrapperNode [2024-11-22 10:57:14,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:57:14,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:57:14,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:57:14,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:57:14,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,558 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-22 10:57:14,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:57:14,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:57:14,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:57:14,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:57:14,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,590 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:57:14,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:57:14,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:57:14,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:57:14,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:57:14,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (1/1) ... [2024-11-22 10:57:14,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:57:14,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:57:14,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:57:14,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:57:14,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:57:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:57:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:57:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:57:14,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:57:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:57:14,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:57:14,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:57:15,053 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 10:57:15,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:57:15,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:57:15,068 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:57:15,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:15 BoogieIcfgContainer [2024-11-22 10:57:15,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:57:15,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:57:15,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:57:15,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:57:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:57:14" (1/3) ... [2024-11-22 10:57:15,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b24713f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:57:15, skipping insertion in model container [2024-11-22 10:57:15,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:14" (2/3) ... [2024-11-22 10:57:15,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b24713f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:57:15, skipping insertion in model container [2024-11-22 10:57:15,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:15" (3/3) ... [2024-11-22 10:57:15,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:15,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:57:15,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:57:15,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:57:15,160 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5dfdf980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:57:15,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:57:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 10:57:15,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:15,203 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:15,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2023651706, now seen corresponding path program 1 times [2024-11-22 10:57:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:57:15,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341705550] [2024-11-22 10:57:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:57:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 10:57:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:57:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341705550] [2024-11-22 10:57:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341705550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:57:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024137641] [2024-11-22 10:57:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:57:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:57:15,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:57:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:57:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:15,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:57:15,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-22 10:57:15,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:57:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024137641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:57:15,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:57:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:57:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003804466] [2024-11-22 10:57:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:15,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:57:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:57:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:57:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:57:15,665 INFO L87 Difference]: Start difference. First operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 10:57:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:15,688 INFO L93 Difference]: Finished difference Result 117 states and 193 transitions. [2024-11-22 10:57:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:57:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-22 10:57:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:15,696 INFO L225 Difference]: With dead ends: 117 [2024-11-22 10:57:15,697 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 10:57:15,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:57:15,703 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:15,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:57:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 10:57:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-22 10:57:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-22 10:57:15,744 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 109 [2024-11-22 10:57:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:15,745 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-22 10:57:15,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 10:57:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-22 10:57:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 10:57:15,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:15,747 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:15,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:57:15,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:57:15,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1837775300, now seen corresponding path program 1 times [2024-11-22 10:57:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:57:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96772030] [2024-11-22 10:57:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:57:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 10:57:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:57:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96772030] [2024-11-22 10:57:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96772030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:57:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:57:16,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:57:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760386960] [2024-11-22 10:57:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:16,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:57:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:57:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:57:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:57:16,561 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:16,812 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-11-22 10:57:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:57:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-22 10:57:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:16,817 INFO L225 Difference]: With dead ends: 199 [2024-11-22 10:57:16,818 INFO L226 Difference]: Without dead ends: 144 [2024-11-22 10:57:16,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:57:16,820 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 148 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:16,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 466 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:57:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-22 10:57:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 67. [2024-11-22 10:57:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2024-11-22 10:57:16,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 109 [2024-11-22 10:57:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2024-11-22 10:57:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2024-11-22 10:57:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 10:57:16,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:16,846 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:16,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:57:16,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:16,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2124806660, now seen corresponding path program 1 times [2024-11-22 10:57:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:57:16,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702084447] [2024-11-22 10:57:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:57:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-22 10:57:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:57:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702084447] [2024-11-22 10:57:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702084447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:57:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:57:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:57:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821862062] [2024-11-22 10:57:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:17,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:57:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:57:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:57:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:57:17,049 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:17,104 INFO L93 Difference]: Finished difference Result 176 states and 255 transitions. [2024-11-22 10:57:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:57:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-22 10:57:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:17,108 INFO L225 Difference]: With dead ends: 176 [2024-11-22 10:57:17,108 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 10:57:17,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:57:17,109 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 73 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:17,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 525 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:57:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 10:57:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 59. [2024-11-22 10:57:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2024-11-22 10:57:17,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 109 [2024-11-22 10:57:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:17,123 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2024-11-22 10:57:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2024-11-22 10:57:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 10:57:17,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:17,124 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:17,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:57:17,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:17,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 867786670, now seen corresponding path program 1 times [2024-11-22 10:57:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:57:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849685123] [2024-11-22 10:57:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:57:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:57:17,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:57:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:57:17,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:57:17,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:57:17,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:57:17,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:57:17,291 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 10:57:17,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:57:17,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:57:17 BoogieIcfgContainer [2024-11-22 10:57:17,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:57:17,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:57:17,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:57:17,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:57:17,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:15" (3/4) ... [2024-11-22 10:57:17,377 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:57:17,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:57:17,379 INFO L158 Benchmark]: Toolchain (without parser) took 3190.32ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 83.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-22 10:57:17,380 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:57:17,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.16ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 93.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:57:17,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.25ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 91.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:57:17,381 INFO L158 Benchmark]: Boogie Preprocessor took 54.15ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:57:17,382 INFO L158 Benchmark]: RCFGBuilder took 454.63ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 70.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:57:17,382 INFO L158 Benchmark]: TraceAbstraction took 2302.07ms. Allocated memory is still 176.2MB. Free memory was 70.1MB in the beginning and 84.1MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:57:17,383 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 176.2MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:57:17,384 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 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.16ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 93.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.25ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 91.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.15ms. Allocated memory is still 176.2MB. Free memory was 91.0MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.63ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 70.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2302.07ms. Allocated memory is still 176.2MB. Free memory was 70.1MB in the beginning and 84.1MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 176.2MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; VAL [isInitial=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L105] RET updateVariables() [L106] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 1075 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 706 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 369 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 130 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:57:17,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:57:19,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:57:19,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:57:19,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:57:19,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:57:19,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:57:19,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:57:19,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:57:19,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:57:19,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:57:19,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:57:19,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:57:19,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:57:19,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:57:19,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:57:19,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:57:19,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:57:19,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:57:19,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:57:19,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:57:19,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:57:19,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:57:19,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:57:19,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:57:19,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:57:19,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:57:19,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:57:19,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:57:19,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:57:19,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:57:19,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:57:19,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:57:19,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:57:19,567 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:57:19,567 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:57:19,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:57:19,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:57:19,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:57:19,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:57:19,569 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 -> 5e76bf897418c531679e53fa28b7c04d453b1c5b37fbed71b943af641f77aed6 [2024-11-22 10:57:19,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:57:19,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:57:19,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:57:19,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:57:19,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:57:19,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:21,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:57:21,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:57:21,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:21,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848258b23/3f38d9543abc4ba0bbe0d8f48fcb9a8a/FLAG9ae9ee93c [2024-11-22 10:57:21,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848258b23/3f38d9543abc4ba0bbe0d8f48fcb9a8a [2024-11-22 10:57:21,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:57:21,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:57:21,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:57:21,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:57:21,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:57:21,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b2ff46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21, skipping insertion in model container [2024-11-22 10:57:21,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:57:21,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2024-11-22 10:57:21,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:57:21,835 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:57:21,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-90.i[915,928] [2024-11-22 10:57:21,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:57:21,888 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:57:21,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21 WrapperNode [2024-11-22 10:57:21,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:57:21,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:57:21,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:57:21,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:57:21,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,928 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-22 10:57:21,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:57:21,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:57:21,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:57:21,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:57:21,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,966 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:57:21,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:57:21,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:57:21,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:57:21,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:57:21,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (1/1) ... [2024-11-22 10:57:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:57:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:57:22,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:57:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:57:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:57:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:57:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:57:22,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:57:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:57:22,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:57:22,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:57:22,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:57:22,390 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 10:57:22,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:57:22,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:57:22,404 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:57:22,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:22 BoogieIcfgContainer [2024-11-22 10:57:22,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:57:22,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:57:22,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:57:22,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:57:22,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:57:21" (1/3) ... [2024-11-22 10:57:22,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e58cf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:57:22, skipping insertion in model container [2024-11-22 10:57:22,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:57:21" (2/3) ... [2024-11-22 10:57:22,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e58cf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:57:22, skipping insertion in model container [2024-11-22 10:57:22,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:22" (3/3) ... [2024-11-22 10:57:22,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-90.i [2024-11-22 10:57:22,426 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:57:22,427 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:57:22,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:57:22,500 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6230abd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:57:22,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:57:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 10:57:22,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:22,517 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:22,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1387335848, now seen corresponding path program 1 times [2024-11-22 10:57:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601247941] [2024-11-22 10:57:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:22,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:22,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:22,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:57:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:22,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:57:22,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-22 10:57:22,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:57:22,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:57:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601247941] [2024-11-22 10:57:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601247941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:57:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:57:22,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:57:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021105395] [2024-11-22 10:57:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:57:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:57:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:57:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:57:22,788 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 10:57:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:22,813 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-22 10:57:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:57:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-22 10:57:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:22,822 INFO L225 Difference]: With dead ends: 95 [2024-11-22 10:57:22,822 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 10:57:22,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:57:22,829 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:22,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:57:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 10:57:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-22 10:57:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-22 10:57:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-22 10:57:22,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2024-11-22 10:57:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:22,870 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-22 10:57:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 10:57:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-22 10:57:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 10:57:22,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:22,875 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:22,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 10:57:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:23,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2101967718, now seen corresponding path program 1 times [2024-11-22 10:57:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574046079] [2024-11-22 10:57:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:23,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:23,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:57:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:23,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 10:57:23,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 10:57:26,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:57:26,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:57:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574046079] [2024-11-22 10:57:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574046079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:57:26,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:57:26,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 10:57:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024931789] [2024-11-22 10:57:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:57:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:57:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:57:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:57:26,183 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:27,569 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2024-11-22 10:57:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 10:57:27,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-22 10:57:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:27,572 INFO L225 Difference]: With dead ends: 128 [2024-11-22 10:57:27,572 INFO L226 Difference]: Without dead ends: 126 [2024-11-22 10:57:27,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2024-11-22 10:57:27,574 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 180 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:27,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 389 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 10:57:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-22 10:57:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2024-11-22 10:57:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 10:57:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-22 10:57:27,595 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 107 [2024-11-22 10:57:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:27,596 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-22 10:57:27,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-22 10:57:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 10:57:27,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:27,598 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:27,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 10:57:27,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:27,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:27,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -417992216, now seen corresponding path program 1 times [2024-11-22 10:57:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:27,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173804345] [2024-11-22 10:57:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:27,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:27,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:27,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:27,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 10:57:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:27,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 10:57:27,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-22 10:57:28,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:57:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 10:57:28,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:57:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173804345] [2024-11-22 10:57:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173804345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:57:28,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:57:28,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-22 10:57:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676926044] [2024-11-22 10:57:28,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 10:57:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 10:57:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:57:28,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 10:57:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:57:28,196 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-22 10:57:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:28,637 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2024-11-22 10:57:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 10:57:28,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2024-11-22 10:57:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:28,640 INFO L225 Difference]: With dead ends: 150 [2024-11-22 10:57:28,640 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 10:57:28,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-22 10:57:28,641 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:28,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 224 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:57:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 10:57:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-22 10:57:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 10:57:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-22 10:57:28,663 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 107 [2024-11-22 10:57:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:28,665 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-22 10:57:28,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-22 10:57:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-22 10:57:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-22 10:57:28,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:28,667 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:28,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:57:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:28,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 331001653, now seen corresponding path program 1 times [2024-11-22 10:57:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:28,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522314061] [2024-11-22 10:57:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:28,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:28,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:28,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:28,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 10:57:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:28,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 10:57:28,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-22 10:57:32,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:57:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 10:57:40,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:57:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522314061] [2024-11-22 10:57:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522314061] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:57:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:57:40,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-22 10:57:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982288364] [2024-11-22 10:57:40,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:40,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 10:57:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:57:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 10:57:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-22 10:57:40,230 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:42,238 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2024-11-22 10:57:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 10:57:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-22 10:57:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:42,240 INFO L225 Difference]: With dead ends: 117 [2024-11-22 10:57:42,240 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 10:57:42,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2024-11-22 10:57:42,243 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:42,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 357 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 10:57:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 10:57:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-22 10:57:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 10:57:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-11-22 10:57:42,259 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 108 [2024-11-22 10:57:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:42,260 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-11-22 10:57:42,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-11-22 10:57:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 10:57:42,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:42,261 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:42,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 10:57:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:42,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785787, now seen corresponding path program 1 times [2024-11-22 10:57:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108543700] [2024-11-22 10:57:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:42,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:42,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 10:57:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:42,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 10:57:42,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-22 10:57:45,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:57:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 10:57:53,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:57:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108543700] [2024-11-22 10:57:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108543700] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:57:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:57:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [35] total 48 [2024-11-22 10:57:53,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558332240] [2024-11-22 10:57:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:57:53,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:57:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:57:53,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:57:53,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2024-11-22 10:57:53,396 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:57:56,358 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2024-11-22 10:57:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 10:57:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-22 10:57:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:57:56,360 INFO L225 Difference]: With dead ends: 131 [2024-11-22 10:57:56,360 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 10:57:56,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=446, Invalid=2416, Unknown=0, NotChecked=0, Total=2862 [2024-11-22 10:57:56,362 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 10:57:56,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 172 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 10:57:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 10:57:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-22 10:57:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-22 10:57:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-11-22 10:57:56,387 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 109 [2024-11-22 10:57:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:57:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-11-22 10:57:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:57:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-11-22 10:57:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-22 10:57:56,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:57:56,389 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:57:56,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 10:57:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:56,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:57:56,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:57:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632829, now seen corresponding path program 1 times [2024-11-22 10:57:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:57:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434533631] [2024-11-22 10:57:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:57:56,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:57:56,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:57:56,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:57:56,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 10:57:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:57:56,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 10:57:56,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:57:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-22 10:57:59,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:58:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-22 10:58:09,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:58:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434533631] [2024-11-22 10:58:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434533631] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:58:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:58:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-22 10:58:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690445332] [2024-11-22 10:58:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:58:09,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 10:58:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:58:09,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 10:58:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2024-11-22 10:58:09,919 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:58:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:58:12,317 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2024-11-22 10:58:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 10:58:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-22 10:58:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:58:12,318 INFO L225 Difference]: With dead ends: 124 [2024-11-22 10:58:12,318 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 10:58:12,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-22 10:58:12,320 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:58:12,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 312 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 10:58:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 10:58:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 10:58:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 10:58:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 10:58:12,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-11-22 10:58:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:58:12,321 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 10:58:12,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-22 10:58:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 10:58:12,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 10:58:12,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:58:12,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 10:58:12,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:58:12,532 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 10:58:12,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 10:58:36,382 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:58:36,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 10:58:36,394 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 10:58:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 10:58:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 10:58:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-22 10:58:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 10:58:36,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-22 10:58:36,396 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-22 10:58:36,402 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-22 10:58:36,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-22 10:58:36,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:58:36 BoogieIcfgContainer [2024-11-22 10:58:36,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:58:36,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:58:36,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:58:36,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:58:36,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:57:22" (3/4) ... [2024-11-22 10:58:36,412 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 10:58:36,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 10:58:36,421 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-22 10:58:36,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 10:58:36,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 10:58:36,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 10:58:36,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 10:58:36,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 10:58:36,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:58:36,514 INFO L158 Benchmark]: Toolchain (without parser) took 74963.18ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 34.6MB in the beginning and 838.2MB in the end (delta: -803.6MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,514 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:58:36,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 37.7MB in the end (delta: -3.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 67.1MB. Free memory was 37.7MB in the beginning and 35.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,515 INFO L158 Benchmark]: Boogie Preprocessor took 57.11ms. Allocated memory is still 67.1MB. Free memory was 35.6MB in the beginning and 33.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,515 INFO L158 Benchmark]: RCFGBuilder took 416.40ms. Allocated memory is still 67.1MB. Free memory was 33.0MB in the beginning and 34.7MB in the end (delta: -1.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,515 INFO L158 Benchmark]: TraceAbstraction took 74002.65ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 34.1MB in the beginning and 844.5MB in the end (delta: -810.4MB). Peak memory consumption was 651.9MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,516 INFO L158 Benchmark]: Witness Printer took 103.70ms. Allocated memory is still 1.1GB. Free memory was 844.5MB in the beginning and 838.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:58:36,517 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.91ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 37.7MB in the end (delta: -3.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 67.1MB. Free memory was 37.7MB in the beginning and 35.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.11ms. Allocated memory is still 67.1MB. Free memory was 35.6MB in the beginning and 33.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 416.40ms. Allocated memory is still 67.1MB. Free memory was 33.0MB in the beginning and 34.7MB in the end (delta: -1.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * TraceAbstraction took 74002.65ms. Allocated memory was 67.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 34.1MB in the beginning and 844.5MB in the end (delta: -810.4MB). Peak memory consumption was 651.9MB. Max. memory is 16.1GB. * Witness Printer took 103.70ms. Allocated memory is still 1.1GB. Free memory was 844.5MB in the beginning and 838.2MB 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 type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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: 19]: 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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 1522 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 407 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1113 GetRequests, 953 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=5, InterpolantAutomatonStates: 73, 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, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1070 ConstructedInterpolants, 17 QuantifiedInterpolants, 12293 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 5302/5440 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: 103]: Loop Invariant Derived loop invariant: (((((var_1_15 <= 1) && (2 == last_1_var_1_6)) && (var_1_6 == 2)) && (var_1_15 >= 1)) || ((((((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)) && (var_1_16 <= 1)) && (var_1_15 >= 1)) && (!((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) Ensures: (((((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) && (0 != cond)) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_6 == \old(last_1_var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 10:58:36,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE