./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodestructure_filler-ps-ci_file-68.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 386002db230de1fc832f3a3f8b28b35e8c97da6783ebc3e93a2f7eda6fced306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:53:17,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:53:17,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:53:17,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:53:17,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:53:17,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:53:17,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:53:17,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:53:17,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:53:17,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:53:17,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:53:17,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:53:17,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:53:17,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:53:17,515 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:53:17,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:53:17,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:53:17,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:53:17,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:53:17,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:53:17,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:53:17,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:53:17,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:53:17,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:53:17,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:53:17,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:53:17,518 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 -> 386002db230de1fc832f3a3f8b28b35e8c97da6783ebc3e93a2f7eda6fced306 [2025-03-08 12:53:17,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:53:17,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:53:17,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:53:17,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:53:17,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:53:17,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:18,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbf6897d/fdc95a7ddde84ddebda8d78c46ef21ed/FLAGa21ad962d [2025-03-08 12:53:19,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:53:19,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:19,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbf6897d/fdc95a7ddde84ddebda8d78c46ef21ed/FLAGa21ad962d [2025-03-08 12:53:19,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbf6897d/fdc95a7ddde84ddebda8d78c46ef21ed [2025-03-08 12:53:19,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:53:19,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:53:19,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:53:19,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:53:19,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:53:19,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e39b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19, skipping insertion in model container [2025-03-08 12:53:19,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:53:19,319 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_fillercode_fillercodestructure_filler-ps-ci_file-68.i[919,932] [2025-03-08 12:53:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:53:19,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:53:19,395 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_fillercode_fillercodestructure_filler-ps-ci_file-68.i[919,932] [2025-03-08 12:53:19,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:53:19,445 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:53:19,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19 WrapperNode [2025-03-08 12:53:19,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:53:19,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:53:19,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:53:19,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:53:19,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,490 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2025-03-08 12:53:19,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:53:19,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:53:19,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:53:19,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:53:19,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,522 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-08 12:53:19,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:53:19,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:53:19,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:53:19,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:53:19,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (1/1) ... [2025-03-08 12:53:19,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:53:19,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:53:19,575 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-08 12:53:19,578 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-08 12:53:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:53:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:53:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:53:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:53:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:53:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:53:19,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:53:19,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:53:19,983 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc property_#t~bitwise18#1; [2025-03-08 12:53:20,011 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 12:53:20,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:53:20,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:53:20,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:53:20,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:20 BoogieIcfgContainer [2025-03-08 12:53:20,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:53:20,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:53:20,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:53:20,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:53:20,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:19" (1/3) ... [2025-03-08 12:53:20,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332a23da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:20, skipping insertion in model container [2025-03-08 12:53:20,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19" (2/3) ... [2025-03-08 12:53:20,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332a23da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:20, skipping insertion in model container [2025-03-08 12:53:20,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:20" (3/3) ... [2025-03-08 12:53:20,041 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:20,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:53:20,052 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:53:20,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:53:20,095 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;@21bb60cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:53:20,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:53:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:53:20,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:20,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:20,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -646972895, now seen corresponding path program 1 times [2025-03-08 12:53:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993195245] [2025-03-08 12:53:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:20,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:53:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:53:20,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:20,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 12:53:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993195245] [2025-03-08 12:53:20,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993195245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:53:20,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525695884] [2025-03-08 12:53:20,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:20,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:53:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:53:20,354 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-08 12:53:20,355 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-08 12:53:20,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:53:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:53:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:20,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:20,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:53:20,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:53:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 12:53:20,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:53:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525695884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:53:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:53:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900321344] [2025-03-08 12:53:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:53:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:20,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:53:20,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:53:20,526 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:53:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:20,549 INFO L93 Difference]: Finished difference Result 174 states and 294 transitions. [2025-03-08 12:53:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:53:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-03-08 12:53:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:20,555 INFO L225 Difference]: With dead ends: 174 [2025-03-08 12:53:20,555 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 12:53:20,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-08 12:53:20,559 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:20,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:53:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 12:53:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 12:53:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2025-03-08 12:53:20,587 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 133 [2025-03-08 12:53:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:20,587 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2025-03-08 12:53:20,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:53:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2025-03-08 12:53:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:53:20,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:20,589 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:20,597 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-08 12:53:20,792 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-08 12:53:20,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:20,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash 360881281, now seen corresponding path program 1 times [2025-03-08 12:53:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884230542] [2025-03-08 12:53:20,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:20,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:53:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:53:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:53:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884230542] [2025-03-08 12:53:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884230542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:53:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096929378] [2025-03-08 12:53:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:21,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:53:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:21,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:53:21,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:53:21,080 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:21,185 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2025-03-08 12:53:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:53:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-08 12:53:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:21,187 INFO L225 Difference]: With dead ends: 173 [2025-03-08 12:53:21,187 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 12:53:21,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:53:21,188 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:21,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 435 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:53:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 12:53:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-08 12:53:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.463768115942029) internal successors, (101), 69 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-03-08 12:53:21,195 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 133 [2025-03-08 12:53:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-03-08 12:53:21,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-03-08 12:53:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:53:21,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:21,199 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:21,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:53:21,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -47942944, now seen corresponding path program 1 times [2025-03-08 12:53:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220151586] [2025-03-08 12:53:21,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:21,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:53:21,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:53:21,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:21,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:53:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220151586] [2025-03-08 12:53:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220151586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:53:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631800163] [2025-03-08 12:53:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:53:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:21,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:53:21,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:53:21,361 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:21,450 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2025-03-08 12:53:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:53:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-08 12:53:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:21,452 INFO L225 Difference]: With dead ends: 175 [2025-03-08 12:53:21,452 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 12:53:21,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:53:21,453 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 122 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:21,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 182 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:53:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 12:53:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 12:53:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2025-03-08 12:53:21,459 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 133 [2025-03-08 12:53:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:21,459 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2025-03-08 12:53:21,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2025-03-08 12:53:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 12:53:21,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:21,460 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:21,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:53:21,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:21,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2004772410, now seen corresponding path program 1 times [2025-03-08 12:53:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049553814] [2025-03-08 12:53:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:21,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:53:21,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:53:21,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:21,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:53:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049553814] [2025-03-08 12:53:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049553814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:21,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:53:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711537119] [2025-03-08 12:53:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:53:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:21,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:53:21,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:53:21,904 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:22,148 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2025-03-08 12:53:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:53:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2025-03-08 12:53:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:22,151 INFO L225 Difference]: With dead ends: 298 [2025-03-08 12:53:22,153 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 12:53:22,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:53:22,156 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 228 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:22,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 474 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:53:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 12:53:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2025-03-08 12:53:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 107 states have internal predecessors, (153), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:53:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2025-03-08 12:53:22,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 134 [2025-03-08 12:53:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:22,176 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2025-03-08 12:53:22,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2025-03-08 12:53:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 12:53:22,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:22,177 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:22,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:53:22,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1567606845, now seen corresponding path program 1 times [2025-03-08 12:53:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977320017] [2025-03-08 12:53:22,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:22,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:22,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:53:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977320017] [2025-03-08 12:53:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977320017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:22,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:22,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:53:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085582925] [2025-03-08 12:53:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:22,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:53:22,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:22,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:53:22,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:53:22,453 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:22,688 INFO L93 Difference]: Finished difference Result 298 states and 455 transitions. [2025-03-08 12:53:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:53:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2025-03-08 12:53:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:22,691 INFO L225 Difference]: With dead ends: 298 [2025-03-08 12:53:22,691 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 12:53:22,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:53:22,692 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 226 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:22,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 472 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:53:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 12:53:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 147. [2025-03-08 12:53:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 108 states have internal predecessors, (154), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:53:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2025-03-08 12:53:22,715 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 135 [2025-03-08 12:53:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:22,715 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2025-03-08 12:53:22,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2025-03-08 12:53:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 12:53:22,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:22,718 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:53:22,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1374050754, now seen corresponding path program 1 times [2025-03-08 12:53:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176607049] [2025-03-08 12:53:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:22,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:22,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:22,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:22,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:53:22,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:53:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176607049] [2025-03-08 12:53:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176607049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:53:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444116442] [2025-03-08 12:53:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:53:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:53:22,880 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-08 12:53:22,882 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-08 12:53:22,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:22,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:53:22,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:53:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:53:23,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:53:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:53:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444116442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:53:23,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:53:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 12:53:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677318436] [2025-03-08 12:53:23,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:53:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:53:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:53:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:53:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:53:23,322 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:53:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:23,447 INFO L93 Difference]: Finished difference Result 268 states and 406 transitions. [2025-03-08 12:53:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:53:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 135 [2025-03-08 12:53:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:23,449 INFO L225 Difference]: With dead ends: 268 [2025-03-08 12:53:23,449 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 12:53:23,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:53:23,451 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:23,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 254 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:53:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 12:53:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-03-08 12:53:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:53:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2025-03-08 12:53:23,470 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 135 [2025-03-08 12:53:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:23,471 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2025-03-08 12:53:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:53:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2025-03-08 12:53:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 12:53:23,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:23,473 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:23,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:53:23,677 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,SelfDestructingSolverStorable5 [2025-03-08 12:53:23,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:23,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:23,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1362734627, now seen corresponding path program 1 times [2025-03-08 12:53:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:53:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718370022] [2025-03-08 12:53:23,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:53:23,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:23,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:53:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519295639] [2025-03-08 12:53:23,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:23,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:53:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:53:23,742 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-08 12:53:23,744 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-08 12:53:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:23,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:53:23,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:53:23,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:53:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:53:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:53:23,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:53:23,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:53:23,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:53:23,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:53:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:53:24,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:53:24,191 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:53:24,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:24 BoogieIcfgContainer [2025-03-08 12:53:24,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:53:24,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:53:24,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:53:24,193 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:53:24,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:20" (3/4) ... [2025-03-08 12:53:24,195 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:53:24,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:53:24,197 INFO L158 Benchmark]: Toolchain (without parser) took 5006.53ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 111.9MB in the beginning and 117.3MB in the end (delta: -5.3MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-08 12:53:24,197 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:53:24,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.75ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 96.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:53:24,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.78ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 92.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:53:24,198 INFO L158 Benchmark]: Boogie Preprocessor took 55.15ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 88.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:53:24,198 INFO L158 Benchmark]: IcfgBuilder took 487.14ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 57.7MB in the end (delta: 30.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:53:24,198 INFO L158 Benchmark]: TraceAbstraction took 4156.86ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 57.3MB in the beginning and 117.3MB in the end (delta: -60.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:53:24,198 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 184.5MB. Free memory was 117.3MB in the beginning and 117.3MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:53:24,199 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.64ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.75ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 96.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.78ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 92.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.15ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 88.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 487.14ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 57.7MB in the end (delta: 30.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4156.86ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 57.3MB in the beginning and 117.3MB in the end (delta: -60.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 184.5MB. Free memory was 117.3MB in the beginning and 117.3MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] double var_1_21 = 4.65; [L37] double var_1_23 = 9999999999.1; [L38] double var_1_24 = 5.5; [L39] unsigned short int var_1_25 = 16; [L40] signed long int var_1_27 = 32; [L41] signed char var_1_31 = 32; [L42] signed char var_1_32 = 32; [L43] signed short int var_1_33 = 100; [L44] unsigned char var_1_34 = 1; [L45] double var_1_35 = 3.8; [L46] signed short int var_1_37 = -256; [L47] unsigned short int var_1_38 = 4; [L48] double last_1_var_1_9 = 4.6; [L49] unsigned char last_1_var_1_12 = 100; [L50] unsigned char last_1_var_1_14 = 0; [L51] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_14 = var_1_14 [L167] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L134] var_1_5 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L135] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L136] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L136] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L137] var_1_7 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L140] var_1_8 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L143] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L143] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L144] var_1_10 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L145] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L146] var_1_13 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L149] var_1_23 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L150] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L151] var_1_24 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L152] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L153] var_1_31 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L154] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L155] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L155] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L156] var_1_32 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L158] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L158] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L159] var_1_35 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L160] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L161] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L161] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L178] RET updateVariables() [L179] CALL step() [L55] var_1_17 = (var_1_5 || (var_1_14 && var_1_5)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L56] COND FALSE !(! var_1_7) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L59] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L60] COND FALSE !(((((var_1_10) > (var_1_24)) ? (var_1_10) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L73] var_1_33 = var_1_31 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L74] COND FALSE !(var_1_31 >= var_1_32) [L79] var_1_34 = ((var_1_24 >= (var_1_10 / var_1_35)) || var_1_7) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L81] EXPR var_1_8 | var_1_8 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L81] EXPR var_1_13 ^ (var_1_8 | var_1_8) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L81] EXPR var_1_31 ^ var_1_8 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L81] COND FALSE !((var_1_13 ^ (var_1_8 | var_1_8)) < (var_1_31 ^ var_1_8)) [L84] var_1_38 = var_1_12 [L85] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L86] COND FALSE !(\read(last_1_var_1_14)) [L97] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L99] var_1_16 = last_1_var_1_12 [L100] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L101] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L102] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L103] COND FALSE !(stepLocal_5 >= var_1_16) [L106] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L109] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L110] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L110] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L111] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L115] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L116] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L117] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=34, var_1_9=23/5] [L120] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L121] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=23/5] [L124] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=23/5] [L125] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L126] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=23/5] [L128] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=23/5] [L129] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L130] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=2] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=2] [L170-L171] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_1=1, var_1_21=93/20, var_1_25=34, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_37=-256, var_1_38=100, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=34, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 161 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 1945 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1264 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 618 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 681 mSDtfsCounter, 618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 137 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1197 ConstructedInterpolants, 0 QuantifiedInterpolants, 2569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 706 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5339/5508 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-08 12:53:24,221 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_fillercode_fillercodestructure_filler-ps-ci_file-68.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 386002db230de1fc832f3a3f8b28b35e8c97da6783ebc3e93a2f7eda6fced306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:53:25,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:53:26,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:53:26,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:53:26,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:53:26,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:53:26,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:53:26,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:53:26,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:53:26,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:53:26,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:53:26,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:53:26,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:53:26,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:53:26,092 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:53:26,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:53:26,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:53:26,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:53:26,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:53:26,094 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 -> 386002db230de1fc832f3a3f8b28b35e8c97da6783ebc3e93a2f7eda6fced306 [2025-03-08 12:53:26,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:53:26,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:53:26,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:53:26,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:53:26,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:53:26,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:27,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f955194/158d78624d9b46d0b712b51ef2e9c3ce/FLAGfc10d0654 [2025-03-08 12:53:27,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:53:27,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:27,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f955194/158d78624d9b46d0b712b51ef2e9c3ce/FLAGfc10d0654 [2025-03-08 12:53:28,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f955194/158d78624d9b46d0b712b51ef2e9c3ce [2025-03-08 12:53:28,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:53:28,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:53:28,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:53:28,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:53:28,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:53:28,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28, skipping insertion in model container [2025-03-08 12:53:28,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:53:28,151 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_fillercode_fillercodestructure_filler-ps-ci_file-68.i[919,932] [2025-03-08 12:53:28,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:53:28,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:53:28,227 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_fillercode_fillercodestructure_filler-ps-ci_file-68.i[919,932] [2025-03-08 12:53:28,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:53:28,263 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:53:28,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28 WrapperNode [2025-03-08 12:53:28,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:53:28,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:53:28,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:53:28,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:53:28,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,294 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-08 12:53:28,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:53:28,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:53:28,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:53:28,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:53:28,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,320 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-08 12:53:28,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:53:28,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:53:28,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:53:28,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:53:28,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (1/1) ... [2025-03-08 12:53:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:53:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:53:28,361 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-08 12:53:28,365 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-08 12:53:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:53:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:53:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:53:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:53:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:53:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:53:28,449 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:53:28,451 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:53:33,672 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 12:53:33,672 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:53:33,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:53:33,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:53:33,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:33 BoogieIcfgContainer [2025-03-08 12:53:33,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:53:33,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:53:33,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:53:33,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:53:33,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:28" (1/3) ... [2025-03-08 12:53:33,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb4ebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:33, skipping insertion in model container [2025-03-08 12:53:33,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:28" (2/3) ... [2025-03-08 12:53:33,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb4ebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:33, skipping insertion in model container [2025-03-08 12:53:33,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:33" (3/3) ... [2025-03-08 12:53:33,685 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i [2025-03-08 12:53:33,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:53:33,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-68.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:53:33,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:53:33,732 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;@3738a0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:53:33,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:53:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 12:53:33,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:33,741 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:33,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 600846070, now seen corresponding path program 1 times [2025-03-08 12:53:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:53:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657962700] [2025-03-08 12:53:33,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:33,756 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-08 12:53:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:53:33,758 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-08 12:53:33,759 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-08 12:53:33,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 12:53:34,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 12:53:34,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:34,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:34,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:53:34,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:53:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-08 12:53:34,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:53:34,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:53:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657962700] [2025-03-08 12:53:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657962700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:53:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255351245] [2025-03-08 12:53:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:53:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:53:34,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:53:34,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:53:34,567 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:53:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:34,585 INFO L93 Difference]: Finished difference Result 138 states and 231 transitions. [2025-03-08 12:53:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:53:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2025-03-08 12:53:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:34,591 INFO L225 Difference]: With dead ends: 138 [2025-03-08 12:53:34,591 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 12:53:34,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-08 12:53:34,595 INFO L435 NwaCegarLoop]: 104 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, 104 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-08 12:53:34,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:53:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 12:53:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 12:53:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-08 12:53:34,625 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 127 [2025-03-08 12:53:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-08 12:53:34,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 12:53:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-08 12:53:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 12:53:34,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:34,630 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:34,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:53:34,830 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-08 12:53:34,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:34,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 27531606, now seen corresponding path program 1 times [2025-03-08 12:53:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:53:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467833025] [2025-03-08 12:53:34,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:34,832 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-08 12:53:34,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:53:34,834 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-08 12:53:34,836 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-08 12:53:34,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 12:53:35,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 12:53:35,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:35,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:35,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:53:35,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:53:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-08 12:53:37,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:53:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:53:38,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:53:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467833025] [2025-03-08 12:53:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467833025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:53:38,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:53:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:53:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655464157] [2025-03-08 12:53:38,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:53:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:53:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:53:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:53:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:53:38,564 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:53:43,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:53:47,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:53:50,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:53:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:50,568 INFO L93 Difference]: Finished difference Result 141 states and 210 transitions. [2025-03-08 12:53:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:53:50,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 127 [2025-03-08 12:53:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:50,580 INFO L225 Difference]: With dead ends: 141 [2025-03-08 12:53:50,580 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 12:53:50,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:53:50,581 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 109 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:50,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2025-03-08 12:53:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 12:53:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-08 12:53:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 12:53:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2025-03-08 12:53:50,591 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 127 [2025-03-08 12:53:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:50,594 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2025-03-08 12:53:50,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:53:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2025-03-08 12:53:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 12:53:50,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:50,595 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:50,617 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-08 12:53:50,795 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-08 12:53:50,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2010524683, now seen corresponding path program 1 times [2025-03-08 12:53:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:53:50,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63682307] [2025-03-08 12:53:50,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:50,797 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-08 12:53:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:53:50,799 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-08 12:53:50,801 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-08 12:53:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 12:53:51,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 12:53:51,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:51,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 12:53:51,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:53:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:53:54,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:53:54,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:53:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63682307] [2025-03-08 12:53:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63682307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:53:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:53:54,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:53:54,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137069760] [2025-03-08 12:53:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:53:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:53:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:53:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:53:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:53:54,175 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:53:59,068 INFO L93 Difference]: Finished difference Result 300 states and 437 transitions. [2025-03-08 12:53:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:53:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-03-08 12:53:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:53:59,081 INFO L225 Difference]: With dead ends: 300 [2025-03-08 12:53:59,081 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 12:53:59,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:53:59,082 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 255 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:53:59,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 485 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 12:53:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 12:53:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 129. [2025-03-08 12:53:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:53:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2025-03-08 12:53:59,103 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 127 [2025-03-08 12:53:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:53:59,103 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2025-03-08 12:53:59,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:53:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2025-03-08 12:53:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 12:53:59,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:53:59,106 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:53:59,125 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-08 12:53:59,307 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-08 12:53:59,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:53:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:53:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 487491254, now seen corresponding path program 1 times [2025-03-08 12:53:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:53:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017043938] [2025-03-08 12:53:59,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:53:59,310 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-08 12:53:59,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:53:59,312 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-08 12:53:59,313 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-08 12:53:59,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 12:53:59,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 12:53:59,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:53:59,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:53:59,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:53:59,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 12:54:00,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:54:00,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017043938] [2025-03-08 12:54:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017043938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:54:00,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:54:00,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:54:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367890601] [2025-03-08 12:54:00,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:54:00,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:54:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:00,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:54:00,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:54:00,198 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:54:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:01,061 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2025-03-08 12:54:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:54:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-03-08 12:54:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:01,071 INFO L225 Difference]: With dead ends: 199 [2025-03-08 12:54:01,071 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 12:54:01,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:54:01,072 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 97 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:01,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 171 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:54:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 12:54:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 12:54:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:54:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2025-03-08 12:54:01,106 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 127 [2025-03-08 12:54:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2025-03-08 12:54:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 12:54:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2025-03-08 12:54:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:54:01,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:01,110 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:54:01,126 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-08 12:54:01,310 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-08 12:54:01,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:01,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1598938606, now seen corresponding path program 1 times [2025-03-08 12:54:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021977974] [2025-03-08 12:54:01,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:01,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-08 12:54:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:01,313 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-08 12:54:01,314 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-08 12:54:01,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:54:01,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:54:01,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:01,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 12:54:01,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-08 12:54:04,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 12:54:05,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021977974] [2025-03-08 12:54:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021977974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:54:05,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:54:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 12:54:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404469735] [2025-03-08 12:54:05,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:54:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:54:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:54:05,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:54:05,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:54:05,932 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:54:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:54:08,343 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2025-03-08 12:54:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:54:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 128 [2025-03-08 12:54:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:54:08,353 INFO L225 Difference]: With dead ends: 215 [2025-03-08 12:54:08,353 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 12:54:08,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:54:08,355 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:54:08,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 331 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 12:54:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 12:54:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-03-08 12:54:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:54:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2025-03-08 12:54:08,370 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 128 [2025-03-08 12:54:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:54:08,370 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2025-03-08 12:54:08,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:54:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2025-03-08 12:54:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:54:08,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:54:08,371 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:54:08,389 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-08 12:54:08,572 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-08 12:54:08,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:54:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:54:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 711434925, now seen corresponding path program 1 times [2025-03-08 12:54:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:54:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904811364] [2025-03-08 12:54:08,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:08,573 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-08 12:54:08,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:54:08,575 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-08 12:54:08,576 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-08 12:54:08,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:54:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:54:09,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:09,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:09,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:54:09,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:54:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 285 proven. 78 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-08 12:54:16,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:54:20,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:54:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904811364] [2025-03-08 12:54:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904811364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:54:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [372028295] [2025-03-08 12:54:20,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:54:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:54:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:54:20,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:54:20,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-08 12:54:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:54:22,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:54:22,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:54:22,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:54:22,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 12:54:22,059 INFO L279 TraceCheckSpWp]: Computing forward predicates...