./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_50-while_file-53.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 19ec7bb5ac2ddd332b9af9aa3f987412414ad8905e881ff619f3733568842d36 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:03:17,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:03:17,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:03:17,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:03:17,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:03:17,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:03:17,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:03:17,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:03:17,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:03:17,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:03:17,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:03:17,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:03:17,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:03:17,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:03:17,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:03:17,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:03:17,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:03:17,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:03:17,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:03:17,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:03:17,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:03:17,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:03:17,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:03:17,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:03:17,641 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 -> 19ec7bb5ac2ddd332b9af9aa3f987412414ad8905e881ff619f3733568842d36 [2025-03-17 04:03:17,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:03:17,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:03:17,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:03:17,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:03:17,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:03:17,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:19,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313a13896/df4ba626e57e499e9bbf46b29da0f773/FLAG618f5fcc5 [2025-03-17 04:03:19,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:03:19,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:19,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313a13896/df4ba626e57e499e9bbf46b29da0f773/FLAG618f5fcc5 [2025-03-17 04:03:19,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313a13896/df4ba626e57e499e9bbf46b29da0f773 [2025-03-17 04:03:19,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:03:19,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:03:19,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:03:19,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:03:19,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:03:19,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19, skipping insertion in model container [2025-03-17 04:03:19,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:03:19,735 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_50-while_file-53.i[915,928] [2025-03-17 04:03:19,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:03:19,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:03:19,808 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_50-while_file-53.i[915,928] [2025-03-17 04:03:19,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:03:19,856 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:03:19,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19 WrapperNode [2025-03-17 04:03:19,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:03:19,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:03:19,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:03:19,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:03:19,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,892 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-17 04:03:19,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:03:19,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:03:19,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:03:19,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:03:19,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,917 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-17 04:03:19,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:03:19,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:03:19,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:03:19,939 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:03:19,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (1/1) ... [2025-03-17 04:03:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:03:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:03:19,965 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-17 04:03:19,968 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-17 04:03:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:03:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:03:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:03:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:03:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:03:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:03:20,044 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:03:20,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:03:20,278 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~ite16#1;havoc property_#t~bitwise15#1;havoc property_#t~short17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-17 04:03:20,308 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 04:03:20,308 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:03:20,326 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:03:20,327 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:03:20,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:03:20 BoogieIcfgContainer [2025-03-17 04:03:20,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:03:20,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:03:20,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:03:20,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:03:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:03:19" (1/3) ... [2025-03-17 04:03:20,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d607e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:03:20, skipping insertion in model container [2025-03-17 04:03:20,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:19" (2/3) ... [2025-03-17 04:03:20,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d607e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:03:20, skipping insertion in model container [2025-03-17 04:03:20,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:03:20" (3/3) ... [2025-03-17 04:03:20,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:20,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:03:20,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-53.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:03:20,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:03:20,406 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;@285f382d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:03:20,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:03:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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-17 04:03:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 04:03:20,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:20,417 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, 1] [2025-03-17 04:03:20,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1248963239, now seen corresponding path program 1 times [2025-03-17 04:03:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 04:03:20,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:20,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 04:03:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 04:03:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:20,642 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-17 04:03:20,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 04:03:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:03:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252174117] [2025-03-17 04:03:20,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:20,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:03:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:03:20,647 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-17 04:03:20,649 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-17 04:03:20,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 04:03:20,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 04:03:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:20,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:03:20,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:20,820 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-17 04:03:20,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252174117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:20,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:03:20,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:03:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152628492] [2025-03-17 04:03:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:20,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:03:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:03:20,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:03:20,850 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-17 04:03:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:20,881 INFO L93 Difference]: Finished difference Result 139 states and 229 transitions. [2025-03-17 04:03:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:03:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 114 [2025-03-17 04:03:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:20,890 INFO L225 Difference]: With dead ends: 139 [2025-03-17 04:03:20,890 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 04:03:20,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-17 04:03:20,895 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:20,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:03:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 04:03:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 04:03:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-17 04:03:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2025-03-17 04:03:20,930 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 114 [2025-03-17 04:03:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:20,931 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2025-03-17 04:03:20,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-17 04:03:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2025-03-17 04:03:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 04:03:20,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:20,934 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, 1] [2025-03-17 04:03:20,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:03:21,137 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-17 04:03:21,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -441712788, now seen corresponding path program 1 times [2025-03-17 04:03:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-03-17 04:03:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 04:03:21,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 04:03:21,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:21,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:21,298 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-17 04:03:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-03-17 04:03:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268515409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:03:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475987634] [2025-03-17 04:03:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:21,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:21,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:21,301 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-17 04:03:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:21,378 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2025-03-17 04:03:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 114 [2025-03-17 04:03:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:21,384 INFO L225 Difference]: With dead ends: 196 [2025-03-17 04:03:21,384 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 04:03:21,385 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-17 04:03:21,386 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 82 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:21,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 238 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:03:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 04:03:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-03-17 04:03:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2025-03-17 04:03:21,401 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 114 [2025-03-17 04:03:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:21,402 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2025-03-17 04:03:21,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-17 04:03:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2025-03-17 04:03:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 04:03:21,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:21,404 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, 1, 1] [2025-03-17 04:03:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:03:21,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:21,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash -388484919, now seen corresponding path program 1 times [2025-03-17 04:03:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103371305] [2025-03-17 04:03:21,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:21,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 04:03:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 04:03:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:21,700 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-17 04:03:21,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103371305] [2025-03-17 04:03:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103371305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:21,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:21,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:03:21,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765130627] [2025-03-17 04:03:21,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:21,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:03:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:03:21,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:03:21,704 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-17 04:03:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:21,968 INFO L93 Difference]: Finished difference Result 429 states and 629 transitions. [2025-03-17 04:03:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:03:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 115 [2025-03-17 04:03:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:21,972 INFO L225 Difference]: With dead ends: 429 [2025-03-17 04:03:21,972 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 04:03:21,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:03:21,974 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:21,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 288 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:03:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 04:03:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2025-03-17 04:03:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 213 states have (on average 1.3333333333333333) internal successors, (284), 213 states have internal predecessors, (284), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 04:03:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2025-03-17 04:03:22,021 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 115 [2025-03-17 04:03:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:22,021 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2025-03-17 04:03:22,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-17 04:03:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2025-03-17 04:03:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 04:03:22,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:22,027 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, 1, 1, 1] [2025-03-17 04:03:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:03:22,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1678159972, now seen corresponding path program 1 times [2025-03-17 04:03:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489161553] [2025-03-17 04:03:22,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:22,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 04:03:22,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 04:03:22,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:22,274 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-17 04:03:22,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489161553] [2025-03-17 04:03:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489161553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:03:22,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743483043] [2025-03-17 04:03:22,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:22,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:22,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:22,277 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-17 04:03:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:22,361 INFO L93 Difference]: Finished difference Result 725 states and 1070 transitions. [2025-03-17 04:03:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 116 [2025-03-17 04:03:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:22,369 INFO L225 Difference]: With dead ends: 725 [2025-03-17 04:03:22,369 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 04:03:22,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 04:03:22,372 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:22,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 200 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:03:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 04:03:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2025-03-17 04:03:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 329 states have (on average 1.3282674772036474) internal successors, (437), 329 states have internal predecessors, (437), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 04:03:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 641 transitions. [2025-03-17 04:03:22,424 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 641 transitions. Word has length 116 [2025-03-17 04:03:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:22,425 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 641 transitions. [2025-03-17 04:03:22,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-17 04:03:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2025-03-17 04:03:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 04:03:22,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:22,428 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, 1, 1, 1, 1] [2025-03-17 04:03:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:03:22,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 317227350, now seen corresponding path program 1 times [2025-03-17 04:03:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-03-17 04:03:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:22,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:03:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:03:22,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:22,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:22,675 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-17 04:03:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626263307] [2025-03-17 04:03:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626263307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:03:22,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194326744] [2025-03-17 04:03:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:03:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:03:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:03:22,678 INFO L87 Difference]: Start difference. First operand 438 states and 641 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-17 04:03:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:22,773 INFO L93 Difference]: Finished difference Result 440 states and 642 transitions. [2025-03-17 04:03:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:22,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 117 [2025-03-17 04:03:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:22,776 INFO L225 Difference]: With dead ends: 440 [2025-03-17 04:03:22,777 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 04:03:22,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:03:22,779 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:22,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 85 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:03:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 04:03:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-17 04:03:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2025-03-17 04:03:22,805 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 117 [2025-03-17 04:03:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:22,806 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2025-03-17 04:03:22,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-17 04:03:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2025-03-17 04:03:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 04:03:22,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:22,808 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, 1, 1, 1, 1] [2025-03-17 04:03:22,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:03:22,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 74898520, now seen corresponding path program 1 times [2025-03-17 04:03:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-03-17 04:03:22,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:03:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:03:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:22,894 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-17 04:03:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-03-17 04:03:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677211677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:03:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569401461] [2025-03-17 04:03:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:22,896 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 04:03:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:23,020 INFO L93 Difference]: Finished difference Result 455 states and 650 transitions. [2025-03-17 04:03:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 117 [2025-03-17 04:03:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:23,023 INFO L225 Difference]: With dead ends: 455 [2025-03-17 04:03:23,023 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 04:03:23,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:23,024 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 91 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:23,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 235 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:03:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 04:03:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 161. [2025-03-17 04:03:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2025-03-17 04:03:23,045 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 117 [2025-03-17 04:03:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2025-03-17 04:03:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 04:03:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2025-03-17 04:03:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 04:03:23,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:23,047 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, 1, 1, 1, 1] [2025-03-17 04:03:23,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:03:23,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1722052839, now seen corresponding path program 1 times [2025-03-17 04:03:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165515056] [2025-03-17 04:03:23,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:23,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:03:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:03:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 04:03:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:03:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165515056] [2025-03-17 04:03:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165515056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:03:23,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927980885] [2025-03-17 04:03:23,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:03:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:03:23,414 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-17 04:03:23,421 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-17 04:03:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 04:03:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 04:03:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:23,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 04:03:23,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 04:03:23,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:03:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 04:03:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927980885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:03:24,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:03:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2025-03-17 04:03:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435601881] [2025-03-17 04:03:24,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:03:24,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 04:03:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:03:24,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 04:03:24,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-17 04:03:24,217 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 04:03:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:26,157 INFO L93 Difference]: Finished difference Result 564 states and 770 transitions. [2025-03-17 04:03:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 04:03:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) Word has length 117 [2025-03-17 04:03:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:26,161 INFO L225 Difference]: With dead ends: 564 [2025-03-17 04:03:26,161 INFO L226 Difference]: Without dead ends: 404 [2025-03-17 04:03:26,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 04:03:26,164 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 731 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:26,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1230 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 04:03:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-17 04:03:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 163. [2025-03-17 04:03:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 124 states have internal predecessors, (156), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 224 transitions. [2025-03-17 04:03:26,194 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 224 transitions. Word has length 117 [2025-03-17 04:03:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:26,194 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 224 transitions. [2025-03-17 04:03:26,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (36), 5 states have call predecessors, (36), 5 states have call successors, (36) [2025-03-17 04:03:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 224 transitions. [2025-03-17 04:03:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 04:03:26,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:26,196 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, 1, 1, 1, 1, 1] [2025-03-17 04:03:26,204 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-17 04:03:26,400 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,SelfDestructingSolverStorable6 [2025-03-17 04:03:26,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1553403555, now seen corresponding path program 1 times [2025-03-17 04:03:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:03:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000956690] [2025-03-17 04:03:26,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:03:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:03:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:03:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:03:26,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251830766] [2025-03-17 04:03:26,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:03:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:03:26,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:03:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:03:26,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:03:26,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:03:26,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:03:26,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:03:26,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 04:03:26,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 04:03:26,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:26,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:03:26,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:03:26,903 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:03:26,904 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:03:26,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:03:27,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:03:27,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:03:27,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:03:27,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:03:27 BoogieIcfgContainer [2025-03-17 04:03:27,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:03:27,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:03:27,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:03:27,219 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:03:27,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:03:20" (3/4) ... [2025-03-17 04:03:27,221 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:03:27,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:03:27,224 INFO L158 Benchmark]: Toolchain (without parser) took 7603.72ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.0MB in the beginning and 124.7MB in the end (delta: -18.7MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2025-03-17 04:03:27,225 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:03:27,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.39ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 91.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:03:27,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:03:27,226 INFO L158 Benchmark]: Boogie Preprocessor took 43.57ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:03:27,226 INFO L158 Benchmark]: IcfgBuilder took 390.35ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 61.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 04:03:27,227 INFO L158 Benchmark]: TraceAbstraction took 6887.23ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.1MB in the beginning and 124.8MB in the end (delta: -63.7MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2025-03-17 04:03:27,227 INFO L158 Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 327.2MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 101.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:03:27,228 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.63ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.39ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 91.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.57ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 390.35ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 61.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6887.23ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.1MB in the beginning and 124.8MB in the end (delta: -63.7MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 4.71ms. Allocated memory is still 327.2MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 101.6kB). 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 shiftLeft at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryArithmeticFLOAToperation at line 61, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] unsigned char last_1_var_1_1 = 0; [L40] unsigned long int last_1_var_1_9 = 10; [L41] signed short int last_1_var_1_14 = 32; [L42] unsigned char last_1_var_1_16 = 1; [L43] signed char last_1_var_1_20 = 1; [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L118] last_1_var_1_1 = var_1_1 [L119] last_1_var_1_9 = var_1_9 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_20 = var_1_20 [L132] RET updateLastVariables() [L133] CALL updateVariables() [L90] var_1_8 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L91] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L93] var_1_11 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L96] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] var_1_15 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L100] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L103] var_1_17 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L107] var_1_18 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L110] var_1_19 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L113] var_1_21 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L114] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L133] RET updateVariables() [L134] CALL step() [L47] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L48] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L49] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L54] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L56] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L58] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L59] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L60] COND TRUE (! var_1_1) || stepLocal_4 [L61] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L69] var_1_20 = var_1_21 [L70] var_1_22 = var_1_12 [L71] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L72] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L76] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L81] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L82] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L83] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L84] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L125] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L125-L126] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 124 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1197 mSDsluCounter, 2375 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1446 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1356 IncrementalHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 929 mSDtfsCounter, 1356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=4, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 403 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1148 ConstructedInterpolants, 0 QuantifiedInterpolants, 2043 SizeOfPredicates, 5 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 5399/5440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:03:27,252 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_50-while_file-53.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 19ec7bb5ac2ddd332b9af9aa3f987412414ad8905e881ff619f3733568842d36 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:03:29,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:03:29,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:03:29,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:03:29,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:03:29,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:03:29,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:03:29,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:03:29,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:03:29,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:03:29,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:03:29,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:03:29,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:03:29,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:03:29,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:03:29,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:03:29,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:03:29,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:03:29,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:03:29,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:03:29,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:03:29,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:03:29,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:03:29,706 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 -> 19ec7bb5ac2ddd332b9af9aa3f987412414ad8905e881ff619f3733568842d36 [2025-03-17 04:03:29,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:03:30,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:03:30,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:03:30,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:03:30,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:03:30,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:31,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f695f27e1/72bce72df3f94a24aa900f0ea64a2f5b/FLAG67f64ad48 [2025-03-17 04:03:31,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:03:31,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:31,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f695f27e1/72bce72df3f94a24aa900f0ea64a2f5b/FLAG67f64ad48 [2025-03-17 04:03:31,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f695f27e1/72bce72df3f94a24aa900f0ea64a2f5b [2025-03-17 04:03:31,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:03:31,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:03:31,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:03:31,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:03:31,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:03:31,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592df117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31, skipping insertion in model container [2025-03-17 04:03:31,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:03:31,746 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_50-while_file-53.i[915,928] [2025-03-17 04:03:31,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:03:31,809 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:03:31,818 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_50-while_file-53.i[915,928] [2025-03-17 04:03:31,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:03:31,857 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:03:31,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31 WrapperNode [2025-03-17 04:03:31,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:03:31,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:03:31,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:03:31,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:03:31,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,907 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-17 04:03:31,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:03:31,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:03:31,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:03:31,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:03:31,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,940 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-17 04:03:31,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:03:31,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:03:31,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:03:31,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:03:31,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (1/1) ... [2025-03-17 04:03:31,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:03:31,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:03:31,998 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-17 04:03:32,001 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-17 04:03:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:03:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:03:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:03:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:03:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:03:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:03:32,105 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:03:32,107 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:03:32,661 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 04:03:32,661 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:03:32,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:03:32,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:03:32,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:03:32 BoogieIcfgContainer [2025-03-17 04:03:32,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:03:32,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:03:32,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:03:32,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:03:32,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:03:31" (1/3) ... [2025-03-17 04:03:32,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e27eb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:03:32, skipping insertion in model container [2025-03-17 04:03:32,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:03:31" (2/3) ... [2025-03-17 04:03:32,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e27eb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:03:32, skipping insertion in model container [2025-03-17 04:03:32,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:03:32" (3/3) ... [2025-03-17 04:03:32,687 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-53.i [2025-03-17 04:03:32,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:03:32,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-53.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:03:32,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:03:32,768 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;@4dedef99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:03:32,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:03:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 04:03:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 04:03:32,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:32,786 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-17 04:03:32,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:32,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash -502415210, now seen corresponding path program 1 times [2025-03-17 04:03:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036145812] [2025-03-17 04:03:32,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:32,806 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-17 04:03:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:32,809 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-17 04:03:32,811 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-17 04:03:32,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 04:03:33,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 04:03:33,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:33,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:33,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:03:33,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-17 04:03:33,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:33,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036145812] [2025-03-17 04:03:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036145812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:03:33,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148447831] [2025-03-17 04:03:33,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:33,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:03:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:33,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:03:33,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:03:33,178 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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-17 04:03:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:33,203 INFO L93 Difference]: Finished difference Result 101 states and 173 transitions. [2025-03-17 04:03:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:03:33,205 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-17 04:03:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:33,210 INFO L225 Difference]: With dead ends: 101 [2025-03-17 04:03:33,211 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 04:03:33,214 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-17 04:03:33,216 INFO L435 NwaCegarLoop]: 75 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, 75 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-17 04:03:33,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:03:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 04:03:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 04:03:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 04:03:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2025-03-17 04:03:33,252 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 108 [2025-03-17 04:03:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:33,252 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2025-03-17 04:03:33,252 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-17 04:03:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2025-03-17 04:03:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 04:03:33,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:33,254 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-17 04:03:33,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:03:33,455 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-17 04:03:33,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:33,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash 969166107, now seen corresponding path program 1 times [2025-03-17 04:03:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765814781] [2025-03-17 04:03:33,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:33,457 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-17 04:03:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:33,490 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-17 04:03:33,491 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-17 04:03:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 04:03:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 04:03:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:33,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 04:03:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:33,729 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-17 04:03:33,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:33,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:33,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765814781] [2025-03-17 04:03:33,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765814781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:33,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:03:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708216238] [2025-03-17 04:03:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:33,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:33,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:33,735 INFO L87 Difference]: Start difference. First operand 50 states and 75 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-17 04:03:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:34,103 INFO L93 Difference]: Finished difference Result 146 states and 219 transitions. [2025-03-17 04:03:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:34,103 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-17 04:03:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:34,106 INFO L225 Difference]: With dead ends: 146 [2025-03-17 04:03:34,106 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 04:03:34,107 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-17 04:03:34,107 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 66 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:34,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 191 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:03:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 04:03:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-17 04:03:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2025-03-17 04:03:34,126 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 108 [2025-03-17 04:03:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:34,126 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2025-03-17 04:03:34,126 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-17 04:03:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2025-03-17 04:03:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 04:03:34,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:34,128 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] [2025-03-17 04:03:34,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:03:34,332 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-17 04:03:34,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:34,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -21513529, now seen corresponding path program 1 times [2025-03-17 04:03:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740722634] [2025-03-17 04:03:34,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:34,333 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-17 04:03:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:34,337 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-17 04:03:34,338 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-17 04:03:34,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 04:03:34,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 04:03:34,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:34,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 04:03:34,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:34,766 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-17 04:03:34,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:34,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740722634] [2025-03-17 04:03:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740722634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:03:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506077456] [2025-03-17 04:03:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:34,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:34,768 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 04:03:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:35,086 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2025-03-17 04:03:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:35,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-17 04:03:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:35,089 INFO L225 Difference]: With dead ends: 197 [2025-03-17 04:03:35,089 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 04:03:35,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-17 04:03:35,090 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:35,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:03:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 04:03:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-17 04:03:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2025-03-17 04:03:35,106 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 109 [2025-03-17 04:03:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:35,107 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2025-03-17 04:03:35,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 04:03:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2025-03-17 04:03:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 04:03:35,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:35,110 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] [2025-03-17 04:03:35,118 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-17 04:03:35,310 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-17 04:03:35,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1594775065, now seen corresponding path program 1 times [2025-03-17 04:03:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:35,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896202330] [2025-03-17 04:03:35,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:35,312 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-17 04:03:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:35,315 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-17 04:03:35,315 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-17 04:03:35,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 04:03:35,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 04:03:35,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:35,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 04:03:35,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:35,514 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-17 04:03:35,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:35,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:35,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896202330] [2025-03-17 04:03:35,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896202330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:35,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:35,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:03:35,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886071234] [2025-03-17 04:03:35,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:35,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:03:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:35,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:03:35,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:03:35,515 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 04:03:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:35,806 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2025-03-17 04:03:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:03:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-17 04:03:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:35,811 INFO L225 Difference]: With dead ends: 258 [2025-03-17 04:03:35,811 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 04:03:35,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-17 04:03:35,813 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:35,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:03:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 04:03:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2025-03-17 04:03:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-17 04:03:35,831 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 109 [2025-03-17 04:03:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:35,832 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-17 04:03:35,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 04:03:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-17 04:03:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 04:03:35,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:35,834 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] [2025-03-17 04:03:35,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 04:03:36,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:03:36,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1566145914, now seen corresponding path program 1 times [2025-03-17 04:03:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630938768] [2025-03-17 04:03:36,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:36,036 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-17 04:03:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:36,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:03:36,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 04:03:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 04:03:36,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 04:03:36,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:36,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:03:36,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 04:03:36,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:03:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 04:03:36,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630938768] [2025-03-17 04:03:36,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630938768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:03:36,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:03:36,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-17 04:03:36,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640117757] [2025-03-17 04:03:36,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:03:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 04:03:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:36,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 04:03:36,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:03:36,512 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 04:03:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:38,185 INFO L93 Difference]: Finished difference Result 329 states and 468 transitions. [2025-03-17 04:03:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 04:03:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 109 [2025-03-17 04:03:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:38,193 INFO L225 Difference]: With dead ends: 329 [2025-03-17 04:03:38,193 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 04:03:38,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-17 04:03:38,195 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 227 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:38,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 466 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 04:03:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 04:03:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 109. [2025-03-17 04:03:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:03:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-03-17 04:03:38,230 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 109 [2025-03-17 04:03:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:38,231 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-03-17 04:03:38,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 04:03:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-03-17 04:03:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 04:03:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:38,236 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] [2025-03-17 04:03:38,246 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 (6)] Ended with exit code 0 [2025-03-17 04:03:38,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:03:38,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:38,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -964143369, now seen corresponding path program 1 times [2025-03-17 04:03:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003063233] [2025-03-17 04:03:38,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:38,441 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-17 04:03:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:38,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:03:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 04:03:38,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 04:03:38,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 04:03:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:38,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:03:38,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:03:39,038 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-17 04:03:39,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:03:39,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:03:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003063233] [2025-03-17 04:03:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003063233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:03:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:03:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:03:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648265577] [2025-03-17 04:03:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:03:39,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:03:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:03:39,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:03:39,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:03:39,039 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-17 04:03:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:03:39,519 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2025-03-17 04:03:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:03:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 110 [2025-03-17 04:03:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:03:39,529 INFO L225 Difference]: With dead ends: 269 [2025-03-17 04:03:39,529 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 04:03:39,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:03:39,530 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:03:39,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 237 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:03:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 04:03:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2025-03-17 04:03:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 04:03:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2025-03-17 04:03:39,557 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 110 [2025-03-17 04:03:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:03:39,558 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2025-03-17 04:03:39,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-17 04:03:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2025-03-17 04:03:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 04:03:39,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:03:39,559 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] [2025-03-17 04:03:39,567 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 (7)] Ended with exit code 0 [2025-03-17 04:03:39,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:03:39,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:03:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:03:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2100688763, now seen corresponding path program 1 times [2025-03-17 04:03:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:03:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405082731] [2025-03-17 04:03:39,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:03:39,762 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-17 04:03:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:03:39,763 INFO L229 MonitoredProcess]: Starting monitored process 8 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-17 04:03:39,765 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 (8)] Waiting until timeout for monitored process [2025-03-17 04:03:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 04:03:39,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 04:03:39,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:03:39,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:03:39,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 04:03:39,937 INFO L279 TraceCheckSpWp]: Computing forward predicates...