./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-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.3.0-?-798a7b3-m [2025-03-03 23:26:32,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:26:32,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:26:32,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:26:32,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:26:32,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:26:32,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:26:32,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:26:32,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:26:32,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:26:32,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:26:32,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:26:32,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:26:32,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:26:32,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:26:32,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:26:32,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:26:32,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:26:32,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:26:32,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:26:32,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-03 23:26:32,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:26:32,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:26:32,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:26:32,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:26:32,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:26:32,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:33,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5999a63e5/51c9683963ba489594517997ca170da0/FLAG594cba8d6 [2025-03-03 23:26:33,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:26:34,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:34,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5999a63e5/51c9683963ba489594517997ca170da0/FLAG594cba8d6 [2025-03-03 23:26:34,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5999a63e5/51c9683963ba489594517997ca170da0 [2025-03-03 23:26:34,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:26:34,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:26:34,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:26:34,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:26:34,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:26:34,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c4a45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34, skipping insertion in model container [2025-03-03 23:26:34,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:26:34,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2025-03-03 23:26:34,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:26:34,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:26:34,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2025-03-03 23:26:34,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:26:34,246 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:26:34,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34 WrapperNode [2025-03-03 23:26:34,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:26:34,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:26:34,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:26:34,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:26:34,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,276 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-03-03 23:26:34,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:26:34,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:26:34,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:26:34,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:26:34,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,293 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]. [2025-03-03 23:26:34,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:26:34,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:26:34,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:26:34,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:26:34,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (1/1) ... [2025-03-03 23:26:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:26:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:26:34,328 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) [2025-03-03 23:26:34,330 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 [2025-03-03 23:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:26:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:26:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:26:34,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:26:34,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:26:34,399 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:26:34,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-03 23:26:34,606 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 23:26:34,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:26:34,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:26:34,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:26:34,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:26:34 BoogieIcfgContainer [2025-03-03 23:26:34,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:26:34,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:26:34,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:26:34,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:26:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:26:34" (1/3) ... [2025-03-03 23:26:34,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19693051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:26:34, skipping insertion in model container [2025-03-03 23:26:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:34" (2/3) ... [2025-03-03 23:26:34,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19693051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:26:34, skipping insertion in model container [2025-03-03 23:26:34,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:26:34" (3/3) ... [2025-03-03 23:26:34,630 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:34,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:26:34,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-92.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:26:34,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:26:34,700 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;@2d8c5dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:26:34,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:26:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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) [2025-03-03 23:26:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:26:34,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:34,715 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:26:34,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:34,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash -570366850, now seen corresponding path program 1 times [2025-03-03 23:26:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:26:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76824992] [2025-03-03 23:26:34,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:26:34,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:26:34,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:26:34,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:34,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:26:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:26:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76824992] [2025-03-03 23:26:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76824992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:26:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706782695] [2025-03-03 23:26:34,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:26:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:26:34,925 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) [2025-03-03 23:26:34,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:26:34,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:26:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:26:35,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:35,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:35,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:26:35,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:26:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:26:35,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:26:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706782695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:26:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:26:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:26:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012604012] [2025-03-03 23:26:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:26:35,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:26:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:26:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:26:35,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:26:35,108 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:26:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:26:35,138 INFO L93 Difference]: Finished difference Result 114 states and 188 transitions. [2025-03-03 23:26:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:26:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2025-03-03 23:26:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:26:35,145 INFO L225 Difference]: With dead ends: 114 [2025-03-03 23:26:35,146 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 23:26:35,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:26:35,152 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:26:35,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:26:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 23:26:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 23:26:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:26:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2025-03-03 23:26:35,187 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 111 [2025-03-03 23:26:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:26:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2025-03-03 23:26:35,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:26:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2025-03-03 23:26:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:26:35,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:35,191 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:26:35,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:26:35,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:26:35,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:35,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 270931583, now seen corresponding path program 1 times [2025-03-03 23:26:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:26:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066136642] [2025-03-03 23:26:35,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:26:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:26:35,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:26:35,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:35,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 23:26:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:26:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066136642] [2025-03-03 23:26:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066136642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:26:35,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:26:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:26:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074899361] [2025-03-03 23:26:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:26:35,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:26:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:26:35,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:26:35,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:26:35,574 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-03-03 23:26:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:26:35,610 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-03-03 23:26:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:26:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 111 [2025-03-03 23:26:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:26:35,614 INFO L225 Difference]: With dead ends: 153 [2025-03-03 23:26:35,614 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 23:26:35,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:26:35,616 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 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 [2025-03-03 23:26:35,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:26:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 23:26:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-03 23:26:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 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) [2025-03-03 23:26:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-03-03 23:26:35,640 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 111 [2025-03-03 23:26:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:26:35,641 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-03-03 23:26:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2025-03-03 23:26:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-03-03 23:26:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:26:35,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:35,644 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:26:35,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:26:35,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:35,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1536522880, now seen corresponding path program 1 times [2025-03-03 23:26:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:26:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734008734] [2025-03-03 23:26:35,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:26:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:26:35,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:26:35,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:35,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 23:26:35,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:26:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734008734] [2025-03-03 23:26:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734008734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:26:35,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:26:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:26:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003626280] [2025-03-03 23:26:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:26:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:26:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:26:35,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:26:35,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:26:35,978 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2025-03-03 23:26:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:26:36,132 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2025-03-03 23:26:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:26:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 111 [2025-03-03 23:26:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:26:36,135 INFO L225 Difference]: With dead ends: 191 [2025-03-03 23:26:36,135 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 23:26:36,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:26:36,136 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:26:36,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:26:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 23:26:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-03 23:26:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 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) [2025-03-03 23:26:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-03 23:26:36,158 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 111 [2025-03-03 23:26:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:26:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-03 23:26:36,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2025-03-03 23:26:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-03 23:26:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 23:26:36,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:36,161 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:26:36,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:26:36,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:36,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 43862910, now seen corresponding path program 1 times [2025-03-03 23:26:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:26:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793130644] [2025-03-03 23:26:36,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:26:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 23:26:36,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 23:26:36,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:36,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:26:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260217980] [2025-03-03 23:26:36,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:26:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:26:36,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:26:36,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:26:36,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 23:26:36,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 23:26:36,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:36,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:26:36,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:26:36,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 23:26:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 23:26:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:26:36,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:26:36,389 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:26:36,389 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:26:36,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:26:36,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 23:26:36,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:26:36,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:26:36,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:26:36 BoogieIcfgContainer [2025-03-03 23:26:36,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:26:36,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:26:36,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:26:36,659 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:26:36,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:26:34" (3/4) ... [2025-03-03 23:26:36,661 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:26:36,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:26:36,663 INFO L158 Benchmark]: Toolchain (without parser) took 2626.28ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 109.1MB in the end (delta: 13.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2025-03-03 23:26:36,663 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:26:36,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.33ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:26:36,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.91ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:26:36,665 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:26:36,665 INFO L158 Benchmark]: IcfgBuilder took 320.44ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 88.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:26:36,665 INFO L158 Benchmark]: TraceAbstraction took 2035.37ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 109.1MB in the end (delta: -21.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:26:36,666 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 109.1MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:26:36,667 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.61ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.33ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.91ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 320.44ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 88.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2035.37ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 109.1MB in the end (delta: -21.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 109.1MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. 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; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=2, 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] [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, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 274 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:26:36,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-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.3.0-?-798a7b3-m [2025-03-03 23:26:38,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:26:38,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:26:38,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:26:38,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:26:38,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:26:38,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:26:38,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:26:38,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:26:38,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:26:38,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:26:38,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:26:38,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:26:38,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:26:38,630 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:26:38,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:26:38,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:26:38,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:26:38,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:26:38,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:26:38,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:26:38,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:26:38,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:26:38,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-03 23:26:38,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:26:38,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:26:38,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:26:38,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:26:38,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:26:38,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:40,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3d2ea70/95ffe11eb9ca458cbe9a8c9588503a58/FLAG878fdad47 [2025-03-03 23:26:40,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:26:40,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:40,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3d2ea70/95ffe11eb9ca458cbe9a8c9588503a58/FLAG878fdad47 [2025-03-03 23:26:40,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3d2ea70/95ffe11eb9ca458cbe9a8c9588503a58 [2025-03-03 23:26:40,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:26:40,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:26:40,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:26:40,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:26:40,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:26:40,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd46de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40, skipping insertion in model container [2025-03-03 23:26:40,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:26:40,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2025-03-03 23:26:40,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:26:40,723 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:26:40,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i[915,928] [2025-03-03 23:26:40,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:26:40,754 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:26:40,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40 WrapperNode [2025-03-03 23:26:40,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:26:40,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:26:40,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:26:40,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:26:40,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,794 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:26:40,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:26:40,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:26:40,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:26:40,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:26:40,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,818 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]. [2025-03-03 23:26:40,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:26:40,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:26:40,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:26:40,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:26:40,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (1/1) ... [2025-03-03 23:26:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:26:40,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:26:40,871 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) [2025-03-03 23:26:40,876 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 [2025-03-03 23:26:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:26:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:26:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:26:40,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:26:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:26:40,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:26:40,959 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:26:40,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:26:41,542 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 23:26:41,542 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:26:41,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:26:41,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:26:41,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:26:41 BoogieIcfgContainer [2025-03-03 23:26:41,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:26:41,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:26:41,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:26:41,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:26:41,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:26:40" (1/3) ... [2025-03-03 23:26:41,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3803434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:26:41, skipping insertion in model container [2025-03-03 23:26:41,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:26:40" (2/3) ... [2025-03-03 23:26:41,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3803434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:26:41, skipping insertion in model container [2025-03-03 23:26:41,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:26:41" (3/3) ... [2025-03-03 23:26:41,557 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2025-03-03 23:26:41,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:26:41,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-92.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:26:41,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:26:41,614 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;@17e0dc34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:26:41,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:26:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 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) [2025-03-03 23:26:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:26:41,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:41,624 INFO L218 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] [2025-03-03 23:26:41,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:41,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 440035703, now seen corresponding path program 1 times [2025-03-03 23:26:41,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:26:41,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19235911] [2025-03-03 23:26:41,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:41,635 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 [2025-03-03 23:26:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:26:41,637 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) [2025-03-03 23:26:41,639 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 [2025-03-03 23:26:41,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:26:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:26:41,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:41,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:41,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:26:41,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:26:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 23:26:41,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:26:41,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:26:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19235911] [2025-03-03 23:26:41,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19235911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:26:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:26:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:26:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118420232] [2025-03-03 23:26:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:26:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:26:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:26:41,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:26:41,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:26:41,828 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-03-03 23:26:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:26:41,844 INFO L93 Difference]: Finished difference Result 96 states and 160 transitions. [2025-03-03 23:26:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:26:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 108 [2025-03-03 23:26:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:26:41,852 INFO L225 Difference]: With dead ends: 96 [2025-03-03 23:26:41,852 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 23:26:41,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:26:41,859 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:26:41,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:26:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 23:26:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 23:26:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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) [2025-03-03 23:26:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-03 23:26:41,911 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 108 [2025-03-03 23:26:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:26:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-03 23:26:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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) [2025-03-03 23:26:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-03 23:26:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:26:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:41,916 INFO L218 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] [2025-03-03 23:26:41,922 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 [2025-03-03 23:26:42,117 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 [2025-03-03 23:26:42,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1736614122, now seen corresponding path program 1 times [2025-03-03 23:26:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:26:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580209664] [2025-03-03 23:26:42,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:42,118 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 [2025-03-03 23:26:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:26:42,120 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) [2025-03-03 23:26:42,121 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 [2025-03-03 23:26:42,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:26:42,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:26:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:26:42,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:26:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 23:26:42,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:26:42,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:26:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580209664] [2025-03-03 23:26:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580209664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:26:42,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:26:42,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:26:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614322596] [2025-03-03 23:26:42,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:26:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:26:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:26:42,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:26:42,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:26:42,291 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-03 23:26:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:26:42,513 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2025-03-03 23:26:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:26:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 108 [2025-03-03 23:26:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:26:42,516 INFO L225 Difference]: With dead ends: 129 [2025-03-03 23:26:42,516 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 23:26:42,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:26:42,518 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:26:42,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:26:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 23:26:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-03-03 23:26:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 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) [2025-03-03 23:26:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2025-03-03 23:26:42,533 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 108 [2025-03-03 23:26:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:26:42,534 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2025-03-03 23:26:42,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-03 23:26:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2025-03-03 23:26:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:26:42,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:26:42,536 INFO L218 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] [2025-03-03 23:26:42,542 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 [2025-03-03 23:26:42,737 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 [2025-03-03 23:26:42,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:26:42,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:26:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash -849110441, now seen corresponding path program 1 times [2025-03-03 23:26:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:26:42,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862441929] [2025-03-03 23:26:42,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:26:42,738 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 [2025-03-03 23:26:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:26:42,767 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) [2025-03-03 23:26:42,768 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 [2025-03-03 23:26:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:26:42,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:26:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:26:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:26:42,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 23:26:42,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:26:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 256 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 23:26:55,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:27:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:27:32,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:27:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862441929] [2025-03-03 23:27:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862441929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:27:32,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:27:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 31 [2025-03-03 23:27:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307030491] [2025-03-03 23:27:32,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:27:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 23:27:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:27:32,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 23:27:32,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2025-03-03 23:27:32,282 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-03 23:28:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:28:12,269 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2025-03-03 23:28:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 23:28:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) Word has length 108 [2025-03-03 23:28:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:28:12,279 INFO L225 Difference]: With dead ends: 167 [2025-03-03 23:28:12,280 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 23:28:12,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=563, Invalid=1987, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 23:28:12,283 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:28:12,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 378 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2025-03-03 23:28:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 23:28:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2025-03-03 23:28:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 91 states have (on average 1.120879120879121) internal successors, (102), 92 states have internal predecessors, (102), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:28:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2025-03-03 23:28:12,301 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 108 [2025-03-03 23:28:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:28:12,303 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2025-03-03 23:28:12,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-03 23:28:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2025-03-03 23:28:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:28:12,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:28:12,305 INFO L218 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] [2025-03-03 23:28:12,310 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 [2025-03-03 23:28:12,505 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 [2025-03-03 23:28:12,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:28:12,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:28:12,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1638402392, now seen corresponding path program 1 times [2025-03-03 23:28:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:28:12,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450268146] [2025-03-03 23:28:12,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:28:12,506 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 [2025-03-03 23:28:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:28:12,508 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) [2025-03-03 23:28:12,509 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 [2025-03-03 23:28:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:28:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:28:12,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:28:12,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:28:12,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 23:28:12,606 INFO L279 TraceCheckSpWp]: Computing forward predicates...