./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:46:00,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:46:00,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:46:00,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:46:00,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:46:00,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:46:00,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:46:00,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:46:00,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:46:00,540 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:46:00,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:46:00,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:46:00,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:46:00,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:46:00,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:46:00,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:46:00,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:46:00,543 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:46:00,543 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:46:00,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:46:00,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:00,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:00,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:00,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:46:00,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:46:00,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:46:00,545 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-jdk21/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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2025-01-09 11:46:00,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:46:00,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:46:00,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:46:00,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:46:00,854 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:46:00,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:02,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/728d2b989/cfaf907fe9234e809ee7fd3533688126/FLAGa12e4e60c [2025-01-09 11:46:02,464 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:46:02,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:02,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/728d2b989/cfaf907fe9234e809ee7fd3533688126/FLAGa12e4e60c [2025-01-09 11:46:02,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/728d2b989/cfaf907fe9234e809ee7fd3533688126 [2025-01-09 11:46:02,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:46:02,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:46:02,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:02,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:46:02,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:46:02,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31aca8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02, skipping insertion in model container [2025-01-09 11:46:02,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:46:02,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-01-09 11:46:02,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:02,740 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:46:02,748 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-01-09 11:46:02,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:02,818 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:46:02,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02 WrapperNode [2025-01-09 11:46:02,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:02,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:02,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:46:02,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:46:02,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,873 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2025-01-09 11:46:02,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:02,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:46:02,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:46:02,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:46:02,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,915 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-01-09 11:46:02,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:46:02,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:46:02,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:46:02,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:46:02,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (1/1) ... [2025-01-09 11:46:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:02,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:46:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:46:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:46:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:46:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:46:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:46:03,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:46:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:46:03,107 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:46:03,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:46:03,581 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:46:03,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:46:03,594 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:46:03,595 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:46:03,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:03 BoogieIcfgContainer [2025-01-09 11:46:03,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:46:03,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:46:03,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:46:03,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:46:03,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:46:02" (1/3) ... [2025-01-09 11:46:03,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:03, skipping insertion in model container [2025-01-09 11:46:03,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:02" (2/3) ... [2025-01-09 11:46:03,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:03, skipping insertion in model container [2025-01-09 11:46:03,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:03" (3/3) ... [2025-01-09 11:46:03,608 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:03,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:46:03,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:46:03,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:46:03,703 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;@77c45ec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:46:03,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:46:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 11:46:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:46:03,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:03,723 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:03,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:03,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash -100659295, now seen corresponding path program 1 times [2025-01-09 11:46:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:03,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923219521] [2025-01-09 11:46:03,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:46:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:46:03,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:03,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 11:46:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923219521] [2025-01-09 11:46:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923219521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:46:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090077676] [2025-01-09 11:46:04,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:04,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:46:04,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:46:04,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:46:04,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:46:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:04,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:46:04,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 11:46:04,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090077676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:04,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:46:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:46:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407747835] [2025-01-09 11:46:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:46:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:04,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:46:04,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:46:04,371 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 11:46:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:04,394 INFO L93 Difference]: Finished difference Result 172 states and 299 transitions. [2025-01-09 11:46:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:46:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2025-01-09 11:46:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:04,401 INFO L225 Difference]: With dead ends: 172 [2025-01-09 11:46:04,402 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 11:46:04,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 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-01-09 11:46:04,409 INFO L435 NwaCegarLoop]: 133 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, 133 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-01-09 11:46:04,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 11:46:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 11:46:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 11:46:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2025-01-09 11:46:04,463 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 183 [2025-01-09 11:46:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2025-01-09 11:46:04,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 11:46:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2025-01-09 11:46:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:46:04,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:04,468 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:04,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:46:04,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:46:04,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 84971057, now seen corresponding path program 1 times [2025-01-09 11:46:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935479257] [2025-01-09 11:46:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:04,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:46:04,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:46:04,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935479257] [2025-01-09 11:46:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935479257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:46:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672739276] [2025-01-09 11:46:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:46:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:05,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:46:05,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:05,225 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:05,281 INFO L93 Difference]: Finished difference Result 252 states and 393 transitions. [2025-01-09 11:46:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:46:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-01-09 11:46:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:05,286 INFO L225 Difference]: With dead ends: 252 [2025-01-09 11:46:05,286 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 11:46:05,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:05,288 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 65 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:05,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 260 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 11:46:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-01-09 11:46:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 11:46:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-01-09 11:46:05,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 183 [2025-01-09 11:46:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:05,328 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-01-09 11:46:05,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-01-09 11:46:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 11:46:05,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:05,331 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:46:05,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1524911563, now seen corresponding path program 1 times [2025-01-09 11:46:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415494802] [2025-01-09 11:46:05,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:05,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 11:46:05,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 11:46:05,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:05,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415494802] [2025-01-09 11:46:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415494802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:46:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287059604] [2025-01-09 11:46:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:46:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:05,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:46:05,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:46:05,856 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:06,113 INFO L93 Difference]: Finished difference Result 347 states and 538 transitions. [2025-01-09 11:46:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:46:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2025-01-09 11:46:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:06,116 INFO L225 Difference]: With dead ends: 347 [2025-01-09 11:46:06,116 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 11:46:06,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:46:06,121 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 125 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:06,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 459 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:46:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 11:46:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2025-01-09 11:46:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 108 states have internal predecessors, (147), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 11:46:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 259 transitions. [2025-01-09 11:46:06,152 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 259 transitions. Word has length 184 [2025-01-09 11:46:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 259 transitions. [2025-01-09 11:46:06,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 259 transitions. [2025-01-09 11:46:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 11:46:06,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:06,159 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:06,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:46:06,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash -32750187, now seen corresponding path program 1 times [2025-01-09 11:46:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7018191] [2025-01-09 11:46:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:06,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 11:46:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 11:46:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7018191] [2025-01-09 11:46:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7018191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:46:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026931355] [2025-01-09 11:46:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:46:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:46:06,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:46:06,693 INFO L87 Difference]: Start difference. First operand 167 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:06,947 INFO L93 Difference]: Finished difference Result 400 states and 623 transitions. [2025-01-09 11:46:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:46:06,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-01-09 11:46:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:06,950 INFO L225 Difference]: With dead ends: 400 [2025-01-09 11:46:06,950 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 11:46:06,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:46:06,951 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:06,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 273 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:46:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 11:46:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2025-01-09 11:46:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 139 states have (on average 1.316546762589928) internal successors, (183), 139 states have internal predecessors, (183), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 11:46:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 351 transitions. [2025-01-09 11:46:07,000 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 351 transitions. Word has length 185 [2025-01-09 11:46:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:07,001 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 351 transitions. [2025-01-09 11:46:07,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 351 transitions. [2025-01-09 11:46:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 11:46:07,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:07,005 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:46:07,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:07,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:07,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1306690216, now seen corresponding path program 1 times [2025-01-09 11:46:07,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102612252] [2025-01-09 11:46:07,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 11:46:07,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 11:46:07,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:07,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102612252] [2025-01-09 11:46:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102612252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:46:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298112400] [2025-01-09 11:46:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:07,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:46:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:46:07,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:07,170 INFO L87 Difference]: Start difference. First operand 227 states and 351 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:07,250 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2025-01-09 11:46:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:46:07,250 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-01-09 11:46:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:07,254 INFO L225 Difference]: With dead ends: 519 [2025-01-09 11:46:07,254 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 11:46:07,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:07,258 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 91 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:07,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 306 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 11:46:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2025-01-09 11:46:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 223 states have (on average 1.336322869955157) internal successors, (298), 225 states have internal predecessors, (298), 122 states have call successors, (122), 5 states have call predecessors, (122), 5 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 11:46:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 542 transitions. [2025-01-09 11:46:07,310 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 542 transitions. Word has length 186 [2025-01-09 11:46:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 542 transitions. [2025-01-09 11:46:07,310 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 542 transitions. [2025-01-09 11:46:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 11:46:07,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:07,313 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:46:07,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1967208726, now seen corresponding path program 1 times [2025-01-09 11:46:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386796826] [2025-01-09 11:46:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:07,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 11:46:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 11:46:07,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:07,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386796826] [2025-01-09 11:46:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386796826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:46:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667642632] [2025-01-09 11:46:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:07,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:46:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:07,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:46:07,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:07,537 INFO L87 Difference]: Start difference. First operand 351 states and 542 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:07,614 INFO L93 Difference]: Finished difference Result 651 states and 995 transitions. [2025-01-09 11:46:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:46:07,615 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2025-01-09 11:46:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:07,620 INFO L225 Difference]: With dead ends: 651 [2025-01-09 11:46:07,621 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 11:46:07,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-09 11:46:07,624 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:07,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 238 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 11:46:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-01-09 11:46:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 237 states have internal predecessors, (306), 122 states have call successors, (122), 9 states have call predecessors, (122), 9 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 11:46:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 550 transitions. [2025-01-09 11:46:07,688 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 550 transitions. Word has length 186 [2025-01-09 11:46:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 550 transitions. [2025-01-09 11:46:07,689 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 550 transitions. [2025-01-09 11:46:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:46:07,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:07,691 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:07,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:46:07,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:07,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1770381151, now seen corresponding path program 1 times [2025-01-09 11:46:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667356278] [2025-01-09 11:46:07,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:07,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:07,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:46:07,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:46:07,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 11:46:08,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:46:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667356278] [2025-01-09 11:46:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667356278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:46:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660627918] [2025-01-09 11:46:08,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:08,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:46:08,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:46:08,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:46:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:46:08,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:08,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:08,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 11:46:08,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-01-09 11:46:09,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:46:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 11:46:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660627918] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:46:09,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:46:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-01-09 11:46:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416000431] [2025-01-09 11:46:09,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:46:09,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:46:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:46:09,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:46:09,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:46:09,506 INFO L87 Difference]: Start difference. First operand 367 states and 550 transitions. Second operand has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-01-09 11:46:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:10,021 INFO L93 Difference]: Finished difference Result 566 states and 821 transitions. [2025-01-09 11:46:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:46:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) Word has length 187 [2025-01-09 11:46:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:10,026 INFO L225 Difference]: With dead ends: 566 [2025-01-09 11:46:10,026 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 11:46:10,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:46:10,028 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 357 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:10,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 402 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:46:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 11:46:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 230. [2025-01-09 11:46:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 147 states have internal predecessors, (182), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 11:46:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-01-09 11:46:10,075 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 187 [2025-01-09 11:46:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-01-09 11:46:10,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.647058823529412) internal successors, (130), 17 states have internal predecessors, (130), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-01-09 11:46:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-01-09 11:46:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 11:46:10,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:10,078 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:10,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:46:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:10,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:10,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 510127370, now seen corresponding path program 1 times [2025-01-09 11:46:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:46:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429438620] [2025-01-09 11:46:10,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:46:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:46:10,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:46:10,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:46:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790888817] [2025-01-09 11:46:10,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:10,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:10,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:10,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:46:10,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:46:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:46:10,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:46:10,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:10,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:46:10,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:46:10,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 11:46:10,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 11:46:10,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:10,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:46:10,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:46:10,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:46:10,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:46:10,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:46:10,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:46:10,978 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:46:11,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:46:11,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:46:11 BoogieIcfgContainer [2025-01-09 11:46:11,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:46:11,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:46:11,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:46:11,133 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:46:11,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:03" (3/4) ... [2025-01-09 11:46:11,135 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:46:11,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:46:11,139 INFO L158 Benchmark]: Toolchain (without parser) took 8648.26ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.6MB in the beginning and 97.3MB in the end (delta: 15.3MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2025-01-09 11:46:11,139 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:46:11,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.65ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:46:11,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.99ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 90.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:46:11,140 INFO L158 Benchmark]: Boogie Preprocessor took 87.55ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 82.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:46:11,140 INFO L158 Benchmark]: RCFGBuilder took 632.73ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 53.2MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 11:46:11,140 INFO L158 Benchmark]: TraceAbstraction took 7534.94ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 52.7MB in the beginning and 97.4MB in the end (delta: -44.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-01-09 11:46:11,141 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 218.1MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:46:11,142 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.65ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.99ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 90.9MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.55ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 82.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 632.73ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 53.2MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7534.94ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 52.7MB in the beginning and 97.4MB in the end (delta: -44.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 218.1MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] double var_1_32 = 255.5; [L48] signed long int var_1_36 = 4; [L49] double var_1_38 = 63.6; [L50] double var_1_40 = 0.0; [L51] signed short int var_1_42 = 128; [L52] unsigned char var_1_45 = 0; [L53] unsigned char var_1_48 = 0; [L54] float var_1_49 = 256.5; [L55] unsigned long int var_1_50 = 100; [L56] double var_1_51 = 63.5; [L57] unsigned char var_1_52 = 50; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L196] isInitial = 1 [L197] FCALL initially() [L199] CALL updateLastVariables() [L188] last_1_var_1_18 = var_1_18 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L148] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L148] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L149] var_1_10 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L150] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L151] var_1_11 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L152] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L153] var_1_13 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L154] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L155] var_1_14 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L156] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L157] var_1_15 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L158] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L159] var_1_16 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L160] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L161] var_1_17 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L162] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L163] var_1_19 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L169] var_1_22 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L171] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L171] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L174] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L174] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L177] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L177] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L180] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L180] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L181] var_1_40 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L182] RET assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L183] var_1_48 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L184] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L185] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L185] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L200] RET updateVariables() [L201] CALL step() [L63] COND TRUE (var_1_21 - var_1_22) <= var_1_25 [L64] var_1_28 = var_1_22 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L66] var_1_32 = ((((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) > (var_1_10)) ? (((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))) : (var_1_10))) [L67] var_1_36 = (((((var_1_7) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) + var_1_7) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L68] EXPR -10 >> var_1_23 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L68] COND TRUE 256 > (-10 >> var_1_23) [L69] var_1_38 = (var_1_16 - (((((var_1_40 - 128.375)) < (var_1_16)) ? ((var_1_40 - 128.375)) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L73] COND TRUE ! (var_1_17 >= (var_1_16 - var_1_40)) [L74] var_1_42 = (((((var_1_7 - 256)) < (var_1_20)) ? ((var_1_7 - 256)) : (var_1_20))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L76] EXPR (var_1_8 * var_1_23) | var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L76] COND TRUE ((var_1_8 * var_1_23) | var_1_7) <= (var_1_20 + 8u) [L77] COND FALSE !(((((16u) < (var_1_20)) ? (16u) : (var_1_20))) < var_1_23) [L80] var_1_45 = ((var_1_23 != (var_1_20 % var_1_21)) || var_1_48) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L83] COND FALSE !(0.83f > var_1_11) [L88] var_1_49 = var_1_11 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L90] var_1_50 = var_1_7 [L91] var_1_51 = var_1_16 [L92] var_1_52 = var_1_8 [L93] signed long int stepLocal_1 = last_1_var_1_20; [L94] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L95] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=50, var_1_8=1, var_1_9=1021/8] [L96] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L99] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=1021/8] [L104] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=84/5, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=1021/8] [L109] var_1_26 = var_1_16 [L110] var_1_27 = 10u [L111] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=1021/8] [L112] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L113] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L117] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L118] COND TRUE var_1_15 >= var_1_26 [L119] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L126] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L127] COND FALSE !(! var_1_18) [L130] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L135] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L136] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=2, var_1_12=254, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=127, var_1_21=253, var_1_22=-129, var_1_23=0, var_1_24=-386, var_1_25=126, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=100, var_1_3=0, var_1_42=-206, var_1_45=1, var_1_48=1, var_1_49=2, var_1_50=50, var_1_51=3, var_1_52=1, var_1_7=1, var_1_8=1, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 2071 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 618 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 944 mSDtfsCounter, 618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 216 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2038 NumberOfCodeBlocks, 2038 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1841 ConstructedInterpolants, 0 QuantifiedInterpolants, 4499 SizeOfPredicates, 4 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 14949/15120 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-01-09 11:46:11,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:46:13,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:46:13,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:46:13,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:46:13,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:46:13,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:46:13,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:46:13,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:46:13,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:46:13,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:46:13,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:46:13,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:46:13,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:46:13,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:46:13,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:13,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:46:13,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:46:13,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:46:13,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:13,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:46:13,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:46:13,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:46:13,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:46:13,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:46:13,698 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-jdk21/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 -> dba54f3464e88b90946abdccde2d7a055f54d4b2bf456cd41e3bbaa9f8dc4f14 [2025-01-09 11:46:13,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:46:13,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:46:13,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:46:13,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:46:13,993 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:46:13,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:15,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/837766fc1/6eb362d1db9f4dd18a948d9ba3593cfd/FLAG12c2a3abb [2025-01-09 11:46:15,706 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:46:15,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:15,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/837766fc1/6eb362d1db9f4dd18a948d9ba3593cfd/FLAG12c2a3abb [2025-01-09 11:46:15,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/837766fc1/6eb362d1db9f4dd18a948d9ba3593cfd [2025-01-09 11:46:15,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:46:15,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:46:15,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:15,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:46:15,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:46:15,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:15" (1/1) ... [2025-01-09 11:46:15,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d76b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:15, skipping insertion in model container [2025-01-09 11:46:15,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:46:15" (1/1) ... [2025-01-09 11:46:15,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:46:15,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-01-09 11:46:16,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:16,028 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:46:16,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i[919,932] [2025-01-09 11:46:16,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:46:16,108 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:46:16,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16 WrapperNode [2025-01-09 11:46:16,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:46:16,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:16,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:46:16,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:46:16,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,171 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-01-09 11:46:16,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:46:16,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:46:16,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:46:16,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:46:16,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,222 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-01-09 11:46:16,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:46:16,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:46:16,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:46:16,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:46:16,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (1/1) ... [2025-01-09 11:46:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:46:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:46:16,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:46:16,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:46:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:46:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:46:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:46:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:46:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:46:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:46:16,430 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:46:16,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:46:24,755 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:46:24,755 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:46:24,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:46:24,768 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:46:24,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:24 BoogieIcfgContainer [2025-01-09 11:46:24,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:46:24,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:46:24,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:46:24,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:46:24,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:46:15" (1/3) ... [2025-01-09 11:46:24,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201a9a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:24, skipping insertion in model container [2025-01-09 11:46:24,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:46:16" (2/3) ... [2025-01-09 11:46:24,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201a9a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:46:24, skipping insertion in model container [2025-01-09 11:46:24,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:46:24" (3/3) ... [2025-01-09 11:46:24,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i [2025-01-09 11:46:24,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:46:24,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-79.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:46:24,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:46:24,865 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;@47b959a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:46:24,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:46:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 11:46:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:46:24,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:24,885 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:24,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1898628836, now seen corresponding path program 1 times [2025-01-09 11:46:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:46:24,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296306467] [2025-01-09 11:46:24,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:24,907 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-01-09 11:46:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:46:24,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 11:46:24,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:46:25,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:46:25,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:46:25,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:25,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:46:25,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-01-09 11:46:25,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:25,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:46:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296306467] [2025-01-09 11:46:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296306467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:46:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049570758] [2025-01-09 11:46:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:25,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:46:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:46:25,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:46:25,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:46:25,666 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 11:46:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:25,702 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-01-09 11:46:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:46:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-01-09 11:46:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:25,712 INFO L225 Difference]: With dead ends: 162 [2025-01-09 11:46:25,713 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 11:46:25,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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-01-09 11:46:25,722 INFO L435 NwaCegarLoop]: 124 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, 124 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-01-09 11:46:25,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:46:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 11:46:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 11:46:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 11:46:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-01-09 11:46:25,779 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 181 [2025-01-09 11:46:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:25,780 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-01-09 11:46:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 11:46:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-01-09 11:46:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 11:46:25,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:25,787 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:25,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:46:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 11:46:25,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1349101940, now seen corresponding path program 1 times [2025-01-09 11:46:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:46:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752003631] [2025-01-09 11:46:25,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:25,990 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-01-09 11:46:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:46:25,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 11:46:25,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:46:26,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 11:46:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 11:46:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:26,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:46:26,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:28,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:28,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:46:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752003631] [2025-01-09 11:46:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752003631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:46:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135047649] [2025-01-09 11:46:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:46:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:46:28,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:46:28,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:46:28,109 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:32,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:35,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:37,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:37,711 INFO L93 Difference]: Finished difference Result 251 states and 386 transitions. [2025-01-09 11:46:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:46:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-01-09 11:46:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:37,743 INFO L225 Difference]: With dead ends: 251 [2025-01-09 11:46:37,743 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 11:46:37,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:46:37,746 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:37,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 423 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2025-01-09 11:46:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 11:46:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2025-01-09 11:46:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 11:46:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2025-01-09 11:46:37,789 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 181 [2025-01-09 11:46:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2025-01-09 11:46:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2025-01-09 11:46:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:46:37,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:37,797 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:37,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 11:46:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 11:46:37,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1584924538, now seen corresponding path program 1 times [2025-01-09 11:46:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:46:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535335145] [2025-01-09 11:46:37,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:37,999 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-01-09 11:46:37,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:46:38,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 11:46:38,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 11:46:38,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:46:38,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:46:38,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:38,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:38,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:46:38,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:39,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:39,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:46:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535335145] [2025-01-09 11:46:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535335145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:39,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:46:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302683519] [2025-01-09 11:46:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:39,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:46:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:46:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:46:39,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:46:39,859 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:43,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:47,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:47,493 INFO L93 Difference]: Finished difference Result 402 states and 617 transitions. [2025-01-09 11:46:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:46:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-01-09 11:46:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:47,499 INFO L225 Difference]: With dead ends: 402 [2025-01-09 11:46:47,499 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 11:46:47,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:46:47,501 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 82 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:47,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 397 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-01-09 11:46:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 11:46:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2025-01-09 11:46:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 11:46:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 337 transitions. [2025-01-09 11:46:47,541 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 337 transitions. Word has length 183 [2025-01-09 11:46:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:47,542 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 337 transitions. [2025-01-09 11:46:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 337 transitions. [2025-01-09 11:46:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 11:46:47,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:47,549 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:47,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 11:46:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 11:46:47,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1843089976, now seen corresponding path program 1 times [2025-01-09 11:46:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:46:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101266995] [2025-01-09 11:46:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:47,751 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-01-09 11:46:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:46:47,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 11:46:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 11:46:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 11:46:48,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 11:46:48,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:48,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:48,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:46:48,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 11:46:48,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:46:48,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:46:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101266995] [2025-01-09 11:46:48,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101266995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:46:48,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:46:48,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:46:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175943569] [2025-01-09 11:46:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:46:48,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:46:48,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:46:48,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:46:48,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:46:48,403 INFO L87 Difference]: Start difference. First operand 220 states and 337 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:52,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:52,821 INFO L93 Difference]: Finished difference Result 382 states and 581 transitions. [2025-01-09 11:46:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:46:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-01-09 11:46:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:52,825 INFO L225 Difference]: With dead ends: 382 [2025-01-09 11:46:52,826 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 11:46:52,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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-01-09 11:46:52,827 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:52,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 222 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 11:46:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 11:46:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-01-09 11:46:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 11:46:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2025-01-09 11:46:52,870 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 183 [2025-01-09 11:46:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:52,871 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2025-01-09 11:46:52,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 11:46:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2025-01-09 11:46:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 11:46:52,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:52,875 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 11:46:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 11:46:53,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:46:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:46:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2132711378, now seen corresponding path program 1 times [2025-01-09 11:46:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:46:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788874567] [2025-01-09 11:46:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:46:53,077 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-01-09 11:46:53,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:46:53,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 11:46:53,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 11:46:53,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 11:46:53,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 11:46:53,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:46:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:46:53,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:46:53,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:46:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 783 proven. 39 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2025-01-09 11:46:54,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:46:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 11:46:54,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:46:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788874567] [2025-01-09 11:46:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788874567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:46:54,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:46:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-01-09 11:46:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356364261] [2025-01-09 11:46:54,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:46:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:46:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:46:54,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:46:54,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:46:54,812 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 11:46:59,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:46:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:46:59,789 INFO L93 Difference]: Finished difference Result 338 states and 489 transitions. [2025-01-09 11:46:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:46:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 184 [2025-01-09 11:46:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:46:59,832 INFO L225 Difference]: With dead ends: 338 [2025-01-09 11:46:59,833 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 11:46:59,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:46:59,834 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 262 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:46:59,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 197 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 11:46:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 11:46:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2025-01-09 11:46:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 147 states have internal predecessors, (180), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 11:46:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2025-01-09 11:46:59,873 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 184 [2025-01-09 11:46:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:46:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2025-01-09 11:46:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 11:46:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2025-01-09 11:46:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 11:46:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:46:59,878 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:46:59,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 11:47:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-01-09 11:47:00,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:47:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:47:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 902002137, now seen corresponding path program 1 times [2025-01-09 11:47:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:47:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787163940] [2025-01-09 11:47:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:47:00,080 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-01-09 11:47:00,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:47:00,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-01-09 11:47:00,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 11:47:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 11:47:00,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 11:47:00,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:47:00,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:47:00,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 11:47:00,633 INFO L279 TraceCheckSpWp]: Computing forward predicates...