./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:43:07,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:43:07,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:43:07,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:43:07,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:43:07,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:43:07,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:43:07,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:43:07,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:43:07,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:43:07,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:43:07,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:43:07,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:43:07,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:43:07,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:43:07,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:43:07,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:43:07,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:43:07,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:43:07,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:43:07,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:43:07,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:43:07,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:43:07,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:43:07,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:43:07,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:43:07,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:43:07,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:43:07,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:43:07,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:43:07,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:43:07,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:43:07,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:43:07,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:43:07,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:43:07,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:43:07,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:43:07,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:43:07,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:43:07,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:43:07,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:43:07,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:43:07,271 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2024-10-24 09:43:07,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:43:07,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:43:07,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:43:07,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:43:07,576 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:43:07,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:09,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:43:09,341 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:43:09,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:09,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3133dad5a/9c604115bb3840ffb54528fe73824ab0/FLAG200aa7ab4 [2024-10-24 09:43:09,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3133dad5a/9c604115bb3840ffb54528fe73824ab0 [2024-10-24 09:43:09,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:43:09,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:43:09,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:43:09,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:43:09,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:43:09,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:43:09" (1/1) ... [2024-10-24 09:43:09,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57016b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:09, skipping insertion in model container [2024-10-24 09:43:09,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:43:09" (1/1) ... [2024-10-24 09:43:09,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:43:09,941 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2024-10-24 09:43:09,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:43:09,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:43:10,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2024-10-24 09:43:10,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:43:10,039 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:43:10,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10 WrapperNode [2024-10-24 09:43:10,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:43:10,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:43:10,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:43:10,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:43:10,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,085 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-24 09:43:10,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:43:10,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:43:10,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:43:10,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:43:10,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,115 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-10-24 09:43:10,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:43:10,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:43:10,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:43:10,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:43:10,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (1/1) ... [2024-10-24 09:43:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:43:10,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:43:10,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:43:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:43:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:43:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:43:10,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:43:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:43:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:43:10,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:43:10,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:43:10,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:43:10,664 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 09:43:10,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:43:10,737 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:43:10,738 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:43:10,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:43:10 BoogieIcfgContainer [2024-10-24 09:43:10,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:43:10,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:43:10,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:43:10,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:43:10,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:43:09" (1/3) ... [2024-10-24 09:43:10,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1aecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:43:10, skipping insertion in model container [2024-10-24 09:43:10,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:10" (2/3) ... [2024-10-24 09:43:10,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1aecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:43:10, skipping insertion in model container [2024-10-24 09:43:10,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:43:10" (3/3) ... [2024-10-24 09:43:10,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:10,762 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:43:10,763 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:43:10,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:43:10,840 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;@79e6feb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:43:10,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:43:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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-10-24 09:43:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:43:10,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:10,856 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-10-24 09:43:10,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:10,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash -476219463, now seen corresponding path program 1 times [2024-10-24 09:43:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:43:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767898925] [2024-10-24 09:43:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:43:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:43:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:43:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:43:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:43:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:43:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:43:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:43:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:43:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:43:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:43:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:43:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:43:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:43:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:43:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:43:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:43:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:43:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:43:11,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:43:11,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767898925] [2024-10-24 09:43:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767898925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:43:11,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:43:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:43:11,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938728906] [2024-10-24 09:43:11,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:43:11,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:43:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:43:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:43:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:43:11,307 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 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) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:43:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:43:11,352 INFO L93 Difference]: Finished difference Result 107 states and 183 transitions. [2024-10-24 09:43:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:43:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 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 107 [2024-10-24 09:43:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:43:11,364 INFO L225 Difference]: With dead ends: 107 [2024-10-24 09:43:11,365 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 09:43:11,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-24 09:43:11,371 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:43:11,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:43:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 09:43:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 09:43:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-10-24 09:43:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-10-24 09:43:11,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 107 [2024-10-24 09:43:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:43:11,427 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-10-24 09:43:11,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:43:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-10-24 09:43:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:43:11,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:11,431 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-10-24 09:43:11,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:43:11,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -699036809, now seen corresponding path program 1 times [2024-10-24 09:43:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:43:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139902060] [2024-10-24 09:43:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:43:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:43:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:43:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:43:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:43:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:43:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:43:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:43:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:43:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:43:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:43:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:43:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:43:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:43:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:43:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:43:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:43:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:43:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:43:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:43:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139902060] [2024-10-24 09:43:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139902060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:43:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:43:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:43:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802774819] [2024-10-24 09:43:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:43:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:43:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:43:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:43:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:43:11,718 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-24 09:43:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:43:11,786 INFO L93 Difference]: Finished difference Result 145 states and 215 transitions. [2024-10-24 09:43:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:43:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 107 [2024-10-24 09:43:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:43:11,791 INFO L225 Difference]: With dead ends: 145 [2024-10-24 09:43:11,791 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 09:43:11,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:43:11,793 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:43:11,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:43:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 09:43:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-24 09:43:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 58 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:43:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-10-24 09:43:11,812 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 107 [2024-10-24 09:43:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:43:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-10-24 09:43:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-24 09:43:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-10-24 09:43:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:43:11,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:11,816 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-10-24 09:43:11,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:43:11,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1508383435, now seen corresponding path program 1 times [2024-10-24 09:43:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:43:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102898724] [2024-10-24 09:43:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:43:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:43:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:43:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:43:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:43:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:43:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:43:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:43:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:43:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:43:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:43:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:43:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:43:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:43:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:43:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:43:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:43:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:43:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:43:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:43:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102898724] [2024-10-24 09:43:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102898724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:43:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:43:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:43:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167672462] [2024-10-24 09:43:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:43:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:43:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:43:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:43:12,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:43:12,369 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-24 09:43:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:43:12,595 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2024-10-24 09:43:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:43:12,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 107 [2024-10-24 09:43:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:43:12,598 INFO L225 Difference]: With dead ends: 180 [2024-10-24 09:43:12,598 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 09:43:12,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:43:12,604 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:43:12,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:43:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 09:43:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 09:43:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:43:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 09:43:12,625 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 107 [2024-10-24 09:43:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:43:12,626 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 09:43:12,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-24 09:43:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 09:43:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:43:12,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:12,629 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-10-24 09:43:12,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:43:12,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1638938234, now seen corresponding path program 1 times [2024-10-24 09:43:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:43:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77588429] [2024-10-24 09:43:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:43:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:43:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727033458] [2024-10-24 09:43:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:43:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:43:12,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:43:12,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:43:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:43:12,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:43:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:43:12,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:43:12,936 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:43:12,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:43:12,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:43:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:43:13,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:43:13,233 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:43:13,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:43:13 BoogieIcfgContainer [2024-10-24 09:43:13,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:43:13,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:43:13,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:43:13,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:43:13,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:43:10" (3/4) ... [2024-10-24 09:43:13,243 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:43:13,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:43:13,246 INFO L158 Benchmark]: Toolchain (without parser) took 3512.23ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 95.9MB in the beginning and 106.7MB in the end (delta: -10.8MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,246 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:43:13,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.43ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 81.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.63ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,250 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 77.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,250 INFO L158 Benchmark]: RCFGBuilder took 605.44ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 77.1MB in the beginning and 160.7MB in the end (delta: -83.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,251 INFO L158 Benchmark]: TraceAbstraction took 2498.29ms. Allocated memory is still 203.4MB. Free memory was 159.6MB in the beginning and 107.7MB in the end (delta: 51.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-10-24 09:43:13,251 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 203.4MB. Free memory was 107.7MB in the beginning and 106.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:43:13,253 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.20ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.43ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 81.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.63ms. Allocated memory is still 151.0MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 77.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.44ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 77.1MB in the beginning and 160.7MB in the end (delta: -83.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2498.29ms. Allocated memory is still 203.4MB. Free memory was 159.6MB in the beginning and 107.7MB in the end (delta: 51.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 203.4MB. Free memory was 107.7MB in the beginning and 106.7MB 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 95, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] signed char var_1_9 = 25; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] float var_1_12 = 0.25; [L34] unsigned short int var_1_13 = 54726; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L74] var_1_5 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L77] var_1_6 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L80] var_1_8 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L81] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) [L39] signed char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] EXPR var_1_6 & var_1_3 VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] COND TRUE ((~ var_1_5) * (var_1_6 & var_1_3)) >= stepLocal_0 [L41] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L43] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L44] COND FALSE !(stepLocal_1 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L47] signed long int stepLocal_4 = var_1_13 - var_1_5; [L48] unsigned char stepLocal_3 = var_1_10; [L49] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L50] COND FALSE !(var_1_11 || stepLocal_3) [L61] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_2=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95-L96] return (((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1)) && ((var_1_10 && var_1_11) ? (var_1_9 == ((signed char) (var_1_3 - var_1_2))) : 1)) && ((var_1_11 || var_1_10) ? ((var_1_10 || (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) < 32)) ? (((var_1_13 - var_1_5) < var_1_2) ? (var_1_12 == ((float) var_1_8)) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 254 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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-10-24 09:43:13,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:43:15,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:43:15,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:43:15,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:43:15,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:43:15,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:43:15,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:43:15,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:43:15,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:43:15,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:43:15,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:43:15,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:43:15,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:43:15,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:43:15,710 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:43:15,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:43:15,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:43:15,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:43:15,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:43:15,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:43:15,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:43:15,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:43:15,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:43:15,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:43:15,716 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:43:15,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:43:15,716 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:43:15,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:43:15,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:43:15,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:43:15,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:43:15,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:43:15,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:43:15,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:43:15,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:43:15,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:43:15,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:43:15,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:43:15,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:43:15,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:43:15,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:43:15,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:43:15,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:43:15,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:43:15,727 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:43:15,727 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2024-10-24 09:43:16,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:43:16,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:43:16,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:43:16,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:43:16,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:43:16,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:17,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:43:18,009 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:43:18,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:18,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f259b59d/e076e0eea2e74fe0857f8f59a305551e/FLAG553e4b578 [2024-10-24 09:43:18,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f259b59d/e076e0eea2e74fe0857f8f59a305551e [2024-10-24 09:43:18,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:43:18,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:43:18,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:43:18,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:43:18,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:43:18,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450b9b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18, skipping insertion in model container [2024-10-24 09:43:18,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:43:18,279 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2024-10-24 09:43:18,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:43:18,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:43:18,372 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2024-10-24 09:43:18,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:43:18,425 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:43:18,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18 WrapperNode [2024-10-24 09:43:18,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:43:18,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:43:18,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:43:18,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:43:18,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,486 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-24 09:43:18,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:43:18,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:43:18,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:43:18,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:43:18,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,524 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-10-24 09:43:18,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:43:18,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:43:18,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:43:18,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:43:18,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (1/1) ... [2024-10-24 09:43:18,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:43:18,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:43:18,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:43:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:43:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:43:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:43:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:43:18,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:43:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:43:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:43:18,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:43:18,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:43:19,780 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 09:43:19,780 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:43:19,856 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:43:19,857 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:43:19,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:43:19 BoogieIcfgContainer [2024-10-24 09:43:19,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:43:19,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:43:19,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:43:19,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:43:19,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:43:18" (1/3) ... [2024-10-24 09:43:19,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ad3173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:43:19, skipping insertion in model container [2024-10-24 09:43:19,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:43:18" (2/3) ... [2024-10-24 09:43:19,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ad3173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:43:19, skipping insertion in model container [2024-10-24 09:43:19,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:43:19" (3/3) ... [2024-10-24 09:43:19,868 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2024-10-24 09:43:19,884 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:43:19,884 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:43:19,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:43:19,964 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;@25693bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:43:19,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:43:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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-10-24 09:43:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:43:19,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:19,986 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] [2024-10-24 09:43:19,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 12788562, now seen corresponding path program 1 times [2024-10-24 09:43:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:43:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173921018] [2024-10-24 09:43:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:20,010 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-10-24 09:43:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:43:20,014 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-10-24 09:43:20,015 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-10-24 09:43:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:20,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:43:20,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:43:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-24 09:43:20,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:43:20,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:43:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173921018] [2024-10-24 09:43:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173921018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:43:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:43:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:43:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663503213] [2024-10-24 09:43:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:43:20,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:43:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:43:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:43:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:43:20,295 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10-24 09:43:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:43:20,532 INFO L93 Difference]: Finished difference Result 89 states and 155 transitions. [2024-10-24 09:43:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:43:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 104 [2024-10-24 09:43:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:43:20,546 INFO L225 Difference]: With dead ends: 89 [2024-10-24 09:43:20,546 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:43:20,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-10-24 09:43:20,553 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:43:20,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:43:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:43:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:43:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-10-24 09:43:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 09:43:20,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 104 [2024-10-24 09:43:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:43:20,597 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 09:43:20,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10-24 09:43:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 09:43:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:43:20,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:20,600 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] [2024-10-24 09:43:20,608 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-10-24 09:43:20,804 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-10-24 09:43:20,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:20,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1236019116, now seen corresponding path program 1 times [2024-10-24 09:43:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:43:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800431058] [2024-10-24 09:43:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:20,808 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-10-24 09:43:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:43:20,811 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-10-24 09:43:20,813 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-10-24 09:43:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:20,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:43:20,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:43:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:43:21,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:43:21,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:43:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800431058] [2024-10-24 09:43:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800431058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:43:21,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:43:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:43:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805192185] [2024-10-24 09:43:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:43:21,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:43:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:43:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:43:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:43:21,006 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-24 09:43:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:43:21,419 INFO L93 Difference]: Finished difference Result 121 states and 178 transitions. [2024-10-24 09:43:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:43:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 104 [2024-10-24 09:43:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:43:21,422 INFO L225 Difference]: With dead ends: 121 [2024-10-24 09:43:21,422 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 09:43:21,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:43:21,428 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:43:21,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:43:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 09:43:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-24 09:43:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:43:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-10-24 09:43:21,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 104 [2024-10-24 09:43:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:43:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-10-24 09:43:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-24 09:43:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-10-24 09:43:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:43:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:43:21,466 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] [2024-10-24 09:43:21,473 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-10-24 09:43:21,666 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-10-24 09:43:21,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:43:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:43:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1178760814, now seen corresponding path program 1 times [2024-10-24 09:43:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:43:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228181537] [2024-10-24 09:43:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:43:21,669 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-10-24 09:43:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:43:21,670 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-10-24 09:43:21,690 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-10-24 09:43:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:43:21,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 09:43:21,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:43:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-24 09:43:31,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:44:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 09:44:07,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:44:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228181537] [2024-10-24 09:44:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228181537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:44:07,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:44:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-24 09:44:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698837761] [2024-10-24 09:44:07,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:44:07,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:44:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:44:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:44:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:44:07,648 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 09:44:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:44:30,193 INFO L93 Difference]: Finished difference Result 114 states and 155 transitions. [2024-10-24 09:44:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 09:44:30,200 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 104 [2024-10-24 09:44:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:44:30,204 INFO L225 Difference]: With dead ends: 114 [2024-10-24 09:44:30,204 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 09:44:30,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-24 09:44:30,206 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:44:30,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 171 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 19.5s Time] [2024-10-24 09:44:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 09:44:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2024-10-24 09:44:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:44:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-10-24 09:44:30,231 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 104 [2024-10-24 09:44:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:44:30,232 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-10-24 09:44:30,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 09:44:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-10-24 09:44:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:44:30,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:44:30,234 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] [2024-10-24 09:44:30,242 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 (4)] Ended with exit code 0 [2024-10-24 09:44:30,438 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-10-24 09:44:30,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:44:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:44:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1988107440, now seen corresponding path program 1 times [2024-10-24 09:44:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:44:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780625679] [2024-10-24 09:44:30,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:44:30,440 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-10-24 09:44:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:44:30,444 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-10-24 09:44:30,446 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-10-24 09:44:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:44:30,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 09:44:30,552 INFO L278 TraceCheckSpWp]: Computing forward predicates...