./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.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 6cd55ba0a3785daa47ae98a9af993c69654ee1c785cb48fb683866b88eb1032f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:42:47,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:42:47,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:42:47,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:42:47,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:42:47,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:42:47,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:42:47,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:42:47,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:42:47,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:42:47,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:42:47,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:42:47,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:42:47,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:42:47,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:42:47,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:47,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:42:47,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:42:47,245 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 -> 6cd55ba0a3785daa47ae98a9af993c69654ee1c785cb48fb683866b88eb1032f [2025-03-03 21:42:47,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:42:47,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:42:47,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:42:47,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:42:47,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:42:47,489 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-75.i [2025-03-03 21:42:48,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a261fb/ca2af478470041bea073448b3e133976/FLAGabf0eec64 [2025-03-03 21:42:48,854 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:42:48,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i [2025-03-03 21:42:48,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a261fb/ca2af478470041bea073448b3e133976/FLAGabf0eec64 [2025-03-03 21:42:49,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a261fb/ca2af478470041bea073448b3e133976 [2025-03-03 21:42:49,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:42:49,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:42:49,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:49,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:42:49,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:42:49,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200550e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49, skipping insertion in model container [2025-03-03 21:42:49,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:42:49,275 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-75.i[919,932] [2025-03-03 21:42:49,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:49,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:42:49,337 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-75.i[919,932] [2025-03-03 21:42:49,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:42:49,377 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:42:49,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49 WrapperNode [2025-03-03 21:42:49,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:42:49,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:49,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:42:49,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:42:49,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,415 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2025-03-03 21:42:49,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:42:49,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:42:49,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:42:49,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:42:49,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,436 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:42:49,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:42:49,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:42:49,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:42:49,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:42:49,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 21:42:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:49,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:42:49,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:42:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:42:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:42:49,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:42:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:42:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:42:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:42:49,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:42:49,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:42:49,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-03-03 21:42:49,969 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:42:49,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:42:49,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:42:49,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:42:49,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:49 BoogieIcfgContainer [2025-03-03 21:42:49,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:42:49,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:42:49,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:42:49,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:42:49,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:49" (1/3) ... [2025-03-03 21:42:49,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433a935d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:49, skipping insertion in model container [2025-03-03 21:42:49,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (2/3) ... [2025-03-03 21:42:49,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433a935d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:49, skipping insertion in model container [2025-03-03 21:42:49,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:49" (3/3) ... [2025-03-03 21:42:49,996 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i [2025-03-03 21:42:50,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:42:50,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:42:50,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:42:50,068 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;@75093b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:42:50,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:42:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:42:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:42:50,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:50,082 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:50,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:50,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1551016197, now seen corresponding path program 1 times [2025-03-03 21:42:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080461269] [2025-03-03 21:42:50,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:50,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:42:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:42:50,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:50,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 21:42:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:50,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080461269] [2025-03-03 21:42:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080461269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:42:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311838058] [2025-03-03 21:42:50,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:50,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:50,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:42:50,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:42:50,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:42:50,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:42:50,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:50,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:50,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:42:50,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:42:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 21:42:50,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:42:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311838058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:50,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:42:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:42:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921998002] [2025-03-03 21:42:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:42:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:50,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:42:50,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:42:50,584 INFO L87 Difference]: Start difference. First operand has 107 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:42:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:50,621 INFO L93 Difference]: Finished difference Result 208 states and 355 transitions. [2025-03-03 21:42:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:42:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-03-03 21:42:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:50,630 INFO L225 Difference]: With dead ends: 208 [2025-03-03 21:42:50,630 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 21:42:50,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:42:50,637 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:42:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 21:42:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-03 21:42:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:42:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2025-03-03 21:42:50,679 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 165 [2025-03-03 21:42:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:50,679 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2025-03-03 21:42:50,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:42:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2025-03-03 21:42:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 21:42:50,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:50,682 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:50,688 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-03 21:42:50,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:42:50,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:50,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1226805800, now seen corresponding path program 1 times [2025-03-03 21:42:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777589365] [2025-03-03 21:42:50,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:50,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 21:42:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 21:42:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:50,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:42:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777589365] [2025-03-03 21:42:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777589365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:42:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869384298] [2025-03-03 21:42:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:51,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:42:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:51,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:42:51,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:51,285 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:51,439 INFO L93 Difference]: Finished difference Result 271 states and 424 transitions. [2025-03-03 21:42:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:42:51,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-03-03 21:42:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:51,442 INFO L225 Difference]: With dead ends: 271 [2025-03-03 21:42:51,442 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 21:42:51,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:42:51,447 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:51,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 260 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:42:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 21:42:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2025-03-03 21:42:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:42:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2025-03-03 21:42:51,466 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 166 [2025-03-03 21:42:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2025-03-03 21:42:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2025-03-03 21:42:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 21:42:51,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:51,471 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:51,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:42:51,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:51,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1488909193, now seen corresponding path program 1 times [2025-03-03 21:42:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701982617] [2025-03-03 21:42:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:51,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:42:51,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:42:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:51,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:42:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701982617] [2025-03-03 21:42:51,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701982617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:51,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:51,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:42:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613937264] [2025-03-03 21:42:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:42:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:42:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:42:51,744 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:51,951 INFO L93 Difference]: Finished difference Result 272 states and 425 transitions. [2025-03-03 21:42:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:42:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-03-03 21:42:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:51,954 INFO L225 Difference]: With dead ends: 272 [2025-03-03 21:42:51,955 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 21:42:51,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 21:42:51,956 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:51,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 325 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:42:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 21:42:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2025-03-03 21:42:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:42:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-03-03 21:42:51,976 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 167 [2025-03-03 21:42:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:51,977 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-03-03 21:42:51,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-03-03 21:42:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 21:42:51,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:51,980 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:51,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:42:51,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:51,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1892098082, now seen corresponding path program 1 times [2025-03-03 21:42:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932105481] [2025-03-03 21:42:51,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:42:52,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:42:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:42:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932105481] [2025-03-03 21:42:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932105481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:52,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:52,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:42:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567658872] [2025-03-03 21:42:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:42:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:52,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:42:52,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:42:52,367 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:53,131 INFO L93 Difference]: Finished difference Result 457 states and 706 transitions. [2025-03-03 21:42:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:42:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-03-03 21:42:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:53,135 INFO L225 Difference]: With dead ends: 457 [2025-03-03 21:42:53,135 INFO L226 Difference]: Without dead ends: 356 [2025-03-03 21:42:53,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:42:53,138 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 442 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:53,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 632 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:42:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-03 21:42:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 320. [2025-03-03 21:42:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 227 states have (on average 1.3568281938325992) internal successors, (308), 228 states have internal predecessors, (308), 87 states have call successors, (87), 5 states have call predecessors, (87), 5 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 21:42:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 482 transitions. [2025-03-03 21:42:53,206 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 482 transitions. Word has length 168 [2025-03-03 21:42:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:53,208 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 482 transitions. [2025-03-03 21:42:53,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:42:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 482 transitions. [2025-03-03 21:42:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 21:42:53,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:53,210 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:53,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:42:53,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:53,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1354318325, now seen corresponding path program 1 times [2025-03-03 21:42:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52225639] [2025-03-03 21:42:53,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:53,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:42:53,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:42:53,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:53,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 21:42:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52225639] [2025-03-03 21:42:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52225639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:42:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544781438] [2025-03-03 21:42:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:53,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:42:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:42:53,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 21:42:53,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 21:42:53,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:53,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:53,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 21:42:53,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:42:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-03 21:42:54,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:42:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 21:42:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544781438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:42:54,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:42:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 22 [2025-03-03 21:42:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859578251] [2025-03-03 21:42:54,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:42:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 21:42:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 21:42:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:42:54,680 INFO L87 Difference]: Start difference. First operand 320 states and 482 transitions. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 5 states have call successors, (56), 3 states have call predecessors, (56), 6 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-03-03 21:42:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:55,615 INFO L93 Difference]: Finished difference Result 539 states and 802 transitions. [2025-03-03 21:42:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:42:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 5 states have call successors, (56), 3 states have call predecessors, (56), 6 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) Word has length 170 [2025-03-03 21:42:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:55,618 INFO L225 Difference]: With dead ends: 539 [2025-03-03 21:42:55,618 INFO L226 Difference]: Without dead ends: 296 [2025-03-03 21:42:55,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 21:42:55,620 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 666 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:55,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 707 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 21:42:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-03 21:42:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2025-03-03 21:42:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 190 states have (on average 1.268421052631579) internal successors, (241), 191 states have internal predecessors, (241), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:42:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2025-03-03 21:42:55,658 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 170 [2025-03-03 21:42:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2025-03-03 21:42:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 5 states have call successors, (56), 3 states have call predecessors, (56), 6 states have return successors, (57), 5 states have call predecessors, (57), 5 states have call successors, (57) [2025-03-03 21:42:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2025-03-03 21:42:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 21:42:55,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:55,661 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:42:55,668 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-03 21:42:55,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:55,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:55,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -843709991, now seen corresponding path program 1 times [2025-03-03 21:42:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246390351] [2025-03-03 21:42:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:55,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:42:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:42:55,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:42:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109995559] [2025-03-03 21:42:55,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:55,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:42:55,917 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-03 21:42:55,918 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-03 21:42:55,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:42:56,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:42:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:42:56,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:42:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 21:42:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 21:42:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:42:56,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:42:56,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:42:56,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:42:56,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:42:56,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:42:56,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 21:42:56,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:42:56,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:42:56 BoogieIcfgContainer [2025-03-03 21:42:56,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:42:56,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:42:56,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:42:56,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:42:56,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:49" (3/4) ... [2025-03-03 21:42:56,540 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:42:56,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:42:56,541 INFO L158 Benchmark]: Toolchain (without parser) took 7374.33ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 123.1MB in the beginning and 327.9MB in the end (delta: -204.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-03-03 21:42:56,541 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:42:56,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.87ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 107.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:42:56,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.97ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:42:56,542 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 101.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:42:56,543 INFO L158 Benchmark]: IcfgBuilder took 535.47ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 74.0MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:42:56,543 INFO L158 Benchmark]: TraceAbstraction took 6547.75ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 72.9MB in the beginning and 328.1MB in the end (delta: -255.2MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2025-03-03 21:42:56,543 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 385.9MB. Free memory was 328.1MB in the beginning and 327.9MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:42:56,544 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.26ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.87ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 107.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.97ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 101.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 535.47ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 74.0MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6547.75ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 72.9MB in the beginning and 328.1MB in the end (delta: -255.2MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 385.9MB. Free memory was 328.1MB in the beginning and 327.9MB in the end (delta: 115.4kB). 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 177, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of bitwiseOr at line 96, overapproximation of bitwiseOr at line 96, overapproximation of someUnaryDOUBLEoperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryArithmeticFLOAToperation at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE (var_1_25 % var_1_28) >= var_1_24 [L55] var_1_26 = (var_1_14 || var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L59] EXPR var_1_25 ^ (var_1_28 + var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L59] COND TRUE (var_1_25 ^ (var_1_28 + var_1_25)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L60] var_1_33 = (((((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) < 0 ) ? -((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) : ((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_7=1] [L68] EXPR var_1_23 & var_1_24 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_7=1] [L68] COND TRUE (var_1_23 & var_1_24) <= var_1_25 [L69] COND FALSE !(var_1_6 <= var_1_6) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_7=1] [L77] var_1_45 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_7=1] [L78] COND FALSE !(var_1_25 != var_1_25) [L81] var_1_46 = ((((4.6) > (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20))))) ? (4.6) : (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L83] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L92] COND TRUE ! (var_1_4 < 16.8f) [L93] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L95] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L96] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L96] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L96] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L96] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L96] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L97] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L105] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L108] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L109] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L114] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L115] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L122] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L124] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L125] COND TRUE stepLocal_0 || var_1_7 [L126] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L128] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L129] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=4, var_1_16=4, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-2, var_1_33=2, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1243 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1227 mSDsluCounter, 2079 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1812 IncrementalHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 697 mSDtfsCounter, 1812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 92 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1519 NumberOfCodeBlocks, 1519 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1333 ConstructedInterpolants, 0 QuantifiedInterpolants, 3070 SizeOfPredicates, 5 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 8714/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:42:56,563 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-75.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 6cd55ba0a3785daa47ae98a9af993c69654ee1c785cb48fb683866b88eb1032f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:42:58,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:42:58,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:42:58,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:42:58,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:42:58,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:42:58,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:42:58,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:42:58,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:42:58,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:42:58,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:42:58,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:42:58,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:42:58,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:42:58,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:42:58,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:42:58,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:42:58,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:42:58,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:42:58,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:42:58,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:42:58,411 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 -> 6cd55ba0a3785daa47ae98a9af993c69654ee1c785cb48fb683866b88eb1032f [2025-03-03 21:42:58,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:42:58,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:42:58,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:42:58,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:42:58,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:42:58,663 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-75.i [2025-03-03 21:42:59,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509400e2a/93ad43ab6ada40b586b186db418fc89e/FLAGd46bd535f [2025-03-03 21:43:00,076 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:43:00,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i [2025-03-03 21:43:00,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509400e2a/93ad43ab6ada40b586b186db418fc89e/FLAGd46bd535f [2025-03-03 21:43:00,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509400e2a/93ad43ab6ada40b586b186db418fc89e [2025-03-03 21:43:00,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:43:00,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:43:00,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:00,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:43:00,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:43:00,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e31555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00, skipping insertion in model container [2025-03-03 21:43:00,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:43:00,229 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-75.i[919,932] [2025-03-03 21:43:00,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:00,295 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:43:00,303 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-75.i[919,932] [2025-03-03 21:43:00,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:43:00,342 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:43:00,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00 WrapperNode [2025-03-03 21:43:00,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:43:00,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:00,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:43:00,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:43:00,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,380 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 21:43:00,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:43:00,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:43:00,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:43:00,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:43:00,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,405 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:43:00,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:43:00,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:43:00,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:43:00,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:43:00,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (1/1) ... [2025-03-03 21:43:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:43:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:43:00,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:43:00,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:43:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:43:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:43:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:43:00,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:43:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:43:00,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:43:00,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:43:00,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:43:28,086 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:43:28,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:43:28,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:43:28,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:43:28,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:28 BoogieIcfgContainer [2025-03-03 21:43:28,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:43:28,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:43:28,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:43:28,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:43:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:00" (1/3) ... [2025-03-03 21:43:28,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f077ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:28, skipping insertion in model container [2025-03-03 21:43:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:00" (2/3) ... [2025-03-03 21:43:28,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f077ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:28, skipping insertion in model container [2025-03-03 21:43:28,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:28" (3/3) ... [2025-03-03 21:43:28,102 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i [2025-03-03 21:43:28,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:43:28,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-75.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:43:28,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:43:28,173 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;@1d2e6643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:43:28,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:43:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:43:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:43:28,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:28,185 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:43:28,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:28,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash 734558083, now seen corresponding path program 1 times [2025-03-03 21:43:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:28,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316078518] [2025-03-03 21:43:28,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:43:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:28,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:43:28,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:43:28,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:43:28,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:43:28,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:28,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:28,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:43:28,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-03 21:43:28,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:43:28,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:43:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316078518] [2025-03-03 21:43:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316078518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:43:28,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:43:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:43:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579360230] [2025-03-03 21:43:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:43:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:43:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:43:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:43:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:43:28,946 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:43:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:43:28,966 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2025-03-03 21:43:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:43:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2025-03-03 21:43:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:43:28,972 INFO L225 Difference]: With dead ends: 156 [2025-03-03 21:43:28,972 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 21:43:28,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:43:28,976 INFO L435 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:43:28,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:43:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 21:43:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 21:43:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:43:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2025-03-03 21:43:29,011 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 159 [2025-03-03 21:43:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:43:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2025-03-03 21:43:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:43:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2025-03-03 21:43:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:43:29,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:43:29,019 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:43:29,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:43:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:43:29,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:43:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:43:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -769973046, now seen corresponding path program 1 times [2025-03-03 21:43:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:43:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021132015] [2025-03-03 21:43:29,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:43:29,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:43:29,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:43:29,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:43:29,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:43:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:43:30,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:43:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:43:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:43:30,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 21:43:30,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:43:59,232 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 21:44:07,370 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 21:44:19,338 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 21:44:27,478 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)